Related papers: The uncrossing partial order on matchings is Euler…

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…

All finite sets of equiangular lines spanning finite-dimensional unitary spaces are determined for which the action on the lines of the set-stabilizer in the unitary group is 2-transitive with a regular normal subgroup.

We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a…

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…

Chen, Deng, Du, Stanley, and Yan introduced the notion of $k$-crossings and $k$-nestings for set partitions, and proved that the sizes of the largest $k$-crossings and $k$-nestings in the partitions of an $n$-set possess a symmetric joint…

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…

In this paper, we study desingularization of vortices for the two-dimensional incompressible Euler equations in the full plane. We construct a family of steady vortex pairs for the Euler equations with a general vorticity function, which…

The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…

We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with $n!$, the factorial function of the infinite Boolean algebra, or $2^{n-1}$, the factorial function…

Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex…

We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…

We introduce posets of simple vertex labeled minors of graphs and a generalization to the level of polymatroids, collectively termed minor posets. We show that any minor poset is isomorphic to the face poset of a regular CW sphere, and in…

We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…