Search

We define a q-linear path in a hypergraph H as a sequence (e1,. . ., eL) of edges of H such that |ei nei+1| [[1, q]] and ei n ej = Ø if |i-j| > 1. In this paper, we study the connected components associated to these paths when q = k - 2 where k is the rank of H. If k = 3 then q = 1 which coincides with the well-known notion of linear path or loose path. We describe the structure of the connected components, using an algorithmic proof which shows that the connected components can be computed in polynomial time. We then mention two consequences of our algorithmic result. The first one is that deciding the winner of the Maker-Breaker game on a hypergraph of rank 3 can be done in polynomial time. The second one is that tractable cases for the NP-complete problem of "Paths Avoiding Forbidden Pairs" in a graph can be deduced from the recognition of a special type of line graph of a hypergraph. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to every other node in the network. The gossiping problem consists in finding the minimum running time (makespan) of a gossiping protocol and algorithms that attain this makespan. We focus on the case where the transmission network is a ring network. We consider synchronous protocols where it takes one unit of time (step) to transmit a unit-length message. During one step, a node receives at most one message only through one of its two neighbors. We also suppose that, during one step, a node cannot be both a sender and a receiver (half duplex model). Moreover communication is subject to interference constraints. We use a primary node interference model where, if a node receives a message from one of its neighbors, its other neighbor cannot send at the same time. With these assumptions we completely solve the problem for ring networks. We first show lower bounds and then give gossiping algorithms which meet these lower bounds and so are optimal. The number of rounds depends on the congruences of n modulo 12. [ABSTRACT FROM AUTHOR]

The Tanny sequence T(i) is a sequence defined recursively as T(i) = T(i - 1 - T(i - 1)) + T(i - 2 - T(i - 2)), T(0) = T(1) = T(2) = 1. In the first part of this paper we give combinatorial proofs of all the results regarding T(i), that Tanny proved in his paper "A well-behaved cousin of the Hofstadter sequence", Discrete Mathematics, 105(1992), pp. 227-239, using algebraic means. In most cases our proofs turn out to be simpler and shorter. Moreover, they give a "visual" appeal to the theory developed by Tanny. We also generalize most of Tanny's results. In the second part of the paper we present many new results regarding T(i) and prove them combinatorially. Given two integers n and k, it is interesting to know if T(n) = k or not. In this paper we characterize such numbers. [ABSTRACT FROM AUTHOR]

In 1961, Erdős asked whether or not there exist words of arbitrary length over a fixed finite alphabet that avoid patterns of the form XX' where X' is a permutation of X (called abelian squares). This problem has since been solved in the affirmative in a series of papers from 1968 to 1992. Much less is known in the case of abelian k-th powers, i.e., words of the form X1X2…Xk where Xi is a permutation of X1 for 2 ≤ i ≤ k. In this paper, we consider crucial words for abelian k-th powers, i.e., finite words that avoid abelian k-th powers, but which cannot be extended to the right by any letter of their own alphabets without creating an abelian k-th power. More specifically, we consider the problem of determining the minimal length of a crucial word avoiding abelian k-th powers. This problem has already been solved for abelian squares by Evdokimov and Kitaev (2004), who showed that a minimal crucial word over an n-letter alphabet An {1,2,…,n} avoiding abelian squares has length 4n-7 for n ≥ 3. Extending this result, we prove that a minimal crucial word over An avoiding abelian cubes has length 9n - 13 for n ≥ 5, and it has length 2, 5, 11, and 20 for n = 1, 2, 3, and 4, respectively. Moreover, for n ≥ 4 and k ge; 2, we give a construction of length k²(n -- 1) - k - 1 of a crucial word over An avoiding abelian k-th powers. This construction gives the minimal length for k = 2 and k = 3. For k ≥ 4 and n ≥ 5, we provide a lower bound for the length of crucial words over An avoiding abelian k-th powers. [ABSTRACT FROM AUTHOR]

In this paper we study a semi on-line version of the classical multiprocessor scheduling problem on two identical processors. We assume that the sum of the tasks and an upper bound on the size of each task are known. Each task has to be assigned upon arrival and the assignment cannot be changed later. The objective is the minimization of the maximum completion time on the processors. In this paper we propose new algorithms and improve known lower and upper bounds on the competitive ratio. Algorithms and bounds depend on the value of . An optimal algorithm, with respect to the competitive ratio, is obtained for γ ∈ [1/n , 2(n+1)/n(2n+1) υ {2n-1/2n(n-1)}, where n is any integer value, n ≥ 2. [ABSTRACT FROM AUTHOR]

Let ℤn denote the ring of integers modulo n. A permutation of ℤn is a sequence of n distinct elements of ℤn. Addition and subtraction of two permutations is defined element-wise. In this paper we consider two extremal problems on permutations of ℤn, namely, the maximum size of a collection of permutations such that the sum of any two distinct permutations in the collection is again a permutation, and the maximum size of a collection of permutations such that no sum of two distinct permutations in the collection is a permutation. Let the sizes be denoted by s(n) and t(n) respectively. The case when n is even is trivial in both the cases, with s(n) = 1 and t(n) = n!. For n odd, we prove (nφ(n))/2k ≤ s(n) ≤ n!·2-(n-1)/2/((n-1)/2)! and 2(n-1)/2·(n-1/2)! ≤ t(n) ≤ 2k · (n-1)!/φ(n), where k is the number of distinct prime divisors of n and φ is the Euler's totient function. [ABSTRACT FROM AUTHOR]

The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as criticality and the uniqueness of the minimum split-coloring. We discuss some properties of split-critical and uniquely split-colorable graphs. We describe constructions of such graphs with some additional properties. We also study the effect of the addition and the removal of some edge sets on the value of the split-chromatic number. All these results are compared with their cochromatic counterparts. We conclude with several research directions on the topic. [ABSTRACT FROM AUTHOR]

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co-multiplication laws, thereby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the concepts of composition and decomposition with the emphasis on combinatorial origin of the ensuing algebraic constructions. [ABSTRACT FROM AUTHOR]

A decomposable combinatorial structure consists of simpler objects called components which by themselves can not be further decomposed. We focus on the multi-set construction where the component generating function C(z) is of alg-log type, that is, C(z) behaves like c + d(1 - z/ρ)α (ln 1 / 1 - z/ρ)β (1 + o(1)) when z is near the dominant singularity ρ. We provide asymptotic results about the size of the smallest components in random combinatorial structures for the cases 0 < α < 1 and any β and α < 0 and β = 0. The particular case α = 0 and β = 1, the so-called exp-log class, has been treated in previous papers. We also provide similar asymptotic estimates for combinatorial objects with a restricted pattern, that is, when part of its factorization pattern is known. We extend our results to include certain type of integers partitions. [ABSTRACT FROM AUTHOR]

In this paper we discuss the bounds of and relations among various kinds of intersection numbers of graphs. Especially, we address extremal graphs with respect to the established bounds. The uniqueness of the minimum-size intersection representations for some graphs is also studied. In the course of this work, we introduce a superclass of chordal graphs, defined in terms of a generalization of simplicial vertex and perfect elimination ordering. Keywords: chordal graph, diamond-free elimination graph, edge clique graph, fractional intersection number, Helly property, intersection graph, intersection number, purple graph, maximal clique, maximal clique irreducible graph, ST weighting algorithm, unique representability. [ABSTRACT FROM AUTHOR]

The following problem was solved by Woodall in 1972: for any pair of nonnegative integers n and k < n/2 - 1 find the minimum integer g(n, k) such that every graph with n vertices and at least g(n, k) edges contains a cycle of length n - k. Woodall proved even more: the size g(n, k), in fact, guarantees the existence of cycles Cp for all 3 ≤ p ≤ n - k. In the paper an analogous problem for bipartite graphs is considered. It is proved that every bipartite graph with color classes of cardinalities m and n; m ≤ n; and size greater than n(m - k - 1) + k + 1 contains a cycle of length 2m - 2k, where m ≥ 1/2k² + 3/2k + 4; k ∈ ℕ. The bound on the number of edges is best possible. Moreover, this size condition guarantees the existence of cycles of all even lengths up to 2m - 2k. We also characterize all extremal graphs for this problem. Finally, we conjecture that the condition on the order may be relaxed to m ≥ 2k + 2. [ABSTRACT FROM AUTHOR]

We consider the sum u of differences between adjacent letters of a word of n letters, chosen uniformly at random from a given alphabet. This paper obtains the enumerating generating function for the number of such words with respect to the sum u, as well as explicit formulas for the mean and variance of u. [ABSTRACT FROM AUTHOR]

A k-uniform hypergraph H = (V;E) is said to be self-complementary whenever it is isomorphic with its complement H̅ = (V; (kV) - E). Every permutation σ of the set V such that σ(e) is an edge of H̅ if and only if e ∈ E is called self-complementing. 2-self-comlementary hypergraphs are exactly self complementary graphs introduced independently by Ringel (1963) and Sachs (1962). For any positive integer n we denote by λ(n) the unique integer such that n = 2λ(n) c, where c is odd. In the paper we prove that a permutation σ of [1; n] with orbits O1,..., Om is a self-complementing permutation of a k-uniform hypergraph of order n if and only if there is an integer l ≥ 0 such that k = a2l + s, a is odd, 0 ≤ s < 2l and the following two conditions hold: (i) n = b2l+1 + r, r ∈ {0,...,2l - 1 + s}, and (ii) ∑i:λ(|Oi|)≤l|Oi|≤ r. For k = 2 this result is the very well known characterization of self-complementing permutation of graphs given by Ringel and Sachs. [ABSTRACT FROM AUTHOR]

A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eventually periodic. If this expansion is finite, β is said to be a simple Parry number. Remind that any Pisot number is a Parry number. In a previous work we have determined the complexity of the fixed point u β of the canonical substitution associated with β-expansions, when β is a simple Parry number. In this paper we consider the case where β is a non-simple Parry number. We determine the structure of infinite left special branches, which are an important tool for the computation of the complexity of uβ. These results allow in particular to obtain the following characterization: the infinite word uβ is Sturmian if and only if β is a quadratic Pisot unit. [ABSTRACT FROM AUTHOR]

At the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whether the dual reflected order yields a Gray code on the Lyndon family. In this paper we give a positive answer. More precisely, we present an O(1)-average-time algorithm for generating length n binary pre-necklaces, necklaces and Lyndon words in Gray code order. [ABSTRACT FROM AUTHOR]

In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determine in O(n min{mα(n, n), m + n log n}) time whether a given graph G on n vertices and m edges contains a house or a hole; this implies an O(n min{mα(n, n), m + n log n})-time and O(n + m)-space algorithm for recognizing HH-free graphs, and in turn leads to an HHD-free graph recognition algorithm exhibiting the same time and space complexity. We also show that determining whether the complement G̅ of the graph G is HH-free can be efficiently resolved in O(nm) time using O(n²) space, which leads to an O(nm)-time and O(n²)-space algorithm for recognizing WPO-graphs. The previously best algorithms for recognizing HH-free, HHD-free, and WPO-graphs required O(n3) time and O(n2) space. [ABSTRACT FROM AUTHOR]

In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determine in O(n min{m α(n, n), m + n log n}) time whether a given graph G on n vertices and m edges contains a house or a hole; this implies an O(n min{m α (n, n), m + n log n})-time and O(n + m)-space algorithm for recognizing HH-free graphs, and in turn leads to an HHD-free graph recognition algorithm exhibiting the same time and space complexity. We also show that determining whether the complement G of the graph G is HH-free can be efficiently resolved in O(nm) time using O(n²) space, which leads to an O(nm)-time and O(n²) space algorithm for recognizing WPO-graphs. The previously best algorithms for recognizing HH-free, HHD-free, and WPO-graphs required O(n³) time and O(n²) space. [ABSTRACT FROM AUTHOR]

Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number of freely braided permutations in Sn. In this paper, we prove that the generating function for the number of freely braided permutations in Sn is given by 1-3x-2x²+(1+x)√p1-4x/1-4x-x²+(1-x²)√1-4x. [ABSTRACT FROM AUTHOR]