English
Related papers

Related papers: On a conjecture about enumerating $(2+2)$-free pos…

200 papers

We study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is $1$ or a prime. In this paper we show that this claim is connected to a strong version…

Combinatorics · Mathematics 2016-10-25 Serafín Ruiz-Cabello

A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…

Combinatorics · Mathematics 2020-09-03 Matteo Cervetti , Luca Ferrari

We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.

Combinatorics · Mathematics 2008-12-09 Maurice Pouzet , Hamza Si Kaddour , Nejib Zaguia

In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.

Disordered Systems and Neural Networks · Physics 2007-05-23 Giorgio Parisi

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

Combinatorics · Mathematics 2024-08-01 Swee Hong Chan , Igor Pak

In 1971 Trotter conjectured that every finite poset on at least $3$ points has a pair whose removal does not decrease the dimension by more than $1$. In 1992 Brightwell and Scheinerman introduced fractional dimension of posets, and they…

Combinatorics · Mathematics 2014-02-03 Csaba Biró , Peter Hamburger , Attila Pór

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

Combinatorics · Mathematics 2017-09-26 Takuro Abe

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

In 1990 West conjectured that there are $2(3n)!/((n+1)!(2n+1)!)$ two-stack sortable permutations on $n$ letters. This conjecture was proved analytically by Zeilberger in 1992. Later, Dulucq, Gire, and Guibert gave a combinatorial proof of…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

A rational Ansatz is proposed for the generating function $\sum_{j,k} \beta_{2j+k,2j}x^j y^k$, where $\beta_{m,u}$ is the number of primitive chinese character diagrams with $u$ univalent and $2m-u$ trivalent vertices. For…

q-alg · Mathematics 2008-02-03 D. J. Broadhurst

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

Group Theory · Mathematics 2024-05-28 Andrea Lucchini , Daniele Nemmi

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number…

Number Theory · Mathematics 2017-09-06 Leonard E. Baum

In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…

Commutative Algebra · Mathematics 2025-12-29 Takayuki Hibi , Francesco Navarra , Ayesha Asloob Qureshi , Sara Saeedi Madani

For any finite poset we define a generating polynomial counting upsets, downsets, and their intersection. We investigate the behaviour of this polynomial with respect to poset operations, show that it distinguishes series-parallel posets,…

Combinatorics · Mathematics 2025-11-20 Ian George , Karen Yeats

The $(P, \omega)$-partition generating function of a labeled poset $(P, \omega)$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to $\mathbb{Z}^+$. We study the expansion of this generating function in the…

Combinatorics · Mathematics 2019-12-24 Ricky Ini Liu , Michael Weselcouch

Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.

Number Theory · Mathematics 2009-11-13 Vladimir Shevelev

We classify all tuples of lattice polyhedra of relative mixed volume 1 and all minimal (by inclusion) tuples of polyhedra of relative mixed volume 2. We also prove a conjecture by A. Esterov, which states that all tuples with finite…

Combinatorics · Mathematics 2020-11-05 Ziyi Zhang

We consider a linear relation which expresses Stanley's chromatic symmetric function for a poset in terms of the chromatic symmetric functions of some closely related posets, which we call the modular law. By applying this in the context of…

Combinatorics · Mathematics 2013-06-12 Mathieu Guay-Paquet

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

Representation Theory · Mathematics 2011-07-13 A. A. Lopatin