Related papers: Linear orderings of combinatorial cubes

In this paper we present some results related to the problem of finding periodic representations for algebraic numbers. In particular, we analyze the problem for cubic irrationalities. We show an interesting relationship between the…

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…

The elements of a finite field of prime order canonically correspond to the integers in an interval. This induces an ordering on the elements of the field. Using this ordering, Kiss and Somlai recently proved interesting properties of the…

We show that a lattice-ordered field (not necessarily commutative) is totally ordered if and only if each square is positive, answering a generalized question of Conrad and Dauns (Pacific J. Math. 30 (1969), 385--398) in the affirmative. As…

An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…

Using earlier results we prove a formula for the number $W_{(n,k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k-1$ descents. This formula will yield the suprising fact that there are as many 2-stack…

Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching…

A polynomial algorithm is obtained for the NP-complete linear ordering problem.

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Let $G$ be an induced subgraph of the hypercube $Q_k$ for some $k$. We show that if $|G|$ is a power of $2$ then, for sufficiciently large $n$, the vertex set of $Q_n$ can be partitioned into induced copies of $G$. This answers a question…

Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching. In this problem we are looking for consecutive substrings of the text that have the same "shape"…

We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…

A ribbon is a double structure on P^1. The geometry of a ribbon is closely related to that of a smooth curve. In this note we consider linear series on ribbons. Our main result is an explicit determinantal description for the locus…

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

For any convex preorder on the set of positive roots of affine type A, we classify and construct all associated cuspidal and semicuspidal skew shapes. These combinatorial objects correspond to cuspidal and semicuspidal skew Specht modules…

A conjecture of Erd\H{o}s states that for any infinite set $A \subseteq \mathbb R$, there exists $E \subseteq \mathbb R$ of positive Lebesgue measure that does not contain any nontrivial affine copy of $A$. The conjecture remains open for…

This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlos--Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…

Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…