English
Related papers

Related papers: Linear extension numbers of $n$-element posets

200 papers

Let $L$ be a finite $n$-element semilattice. We prove that if $L$ has at least $127\cdot 2^{n-8}$ subsemilattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar semilattice with exactly $127\cdot 2^{n-8}-1$…

Rings and Algebras · Mathematics 2019-07-03 Gábor Czédli

For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…

Combinatorics · Mathematics 2021-11-30 Swee Hong Chan , Igor Pak , Greta Panova

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2016-01-28 Liuquan Wang

The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…

Combinatorics · Mathematics 2020-03-10 Zoltán L. Blázsik , Zoltán Lóránt Nagy

In this paper we consider arbitrary intervals in the left weak order on the symmetric group $S_n$. We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the…

Combinatorics · Mathematics 2013-08-20 Hugh Denoncourt

The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements of P appearing in different orders in…

Combinatorics · Mathematics 2009-07-13 Stefan Felsner , Mareike Massow

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

Number Theory · Mathematics 2016-04-12 D. K. L. Shiu

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

Classical Analysis and ODEs · Mathematics 2023-04-21 Laurestine Bradford , Hannah Kohut , Yuveshen Mooroogen

In this paper we discuss finite presentability of the universal central extensions of Lie algebras ${\mathfrak{sl}_n(R)}$, where $n\geq 3$ and $R$ is a unital associative $k$-algebra. We show that a universal central extension is finitely…

Rings and Algebras · Mathematics 2020-04-14 Efim Zelmanov , Zezhou Zhang

We provide precise asymptotics for the number of antichains in the poset $\{0,1,2\}^n$, answering a question of Sapozhenko. Finding improved estimates for this number was also a problem suggested by Noel, Scott, and Sudakov, who obtained…

Combinatorics · Mathematics 2026-01-13 Matthew Jenssen , Jinyoung Park , Michail Sarantis

We prove that every not necessarily bounded poset P=(P,\le,') with an antitone involution can be extended to a residuated poset E(P)=(E(P),\le,\odot,\rightarrow,1) where x'=x\rightarrow0 for all x\in P. If P is a lattice with an antitone…

Rings and Algebras · Mathematics 2020-04-30 Ivan Chajda , Miroslav Kolařík , Helmut Länger

In this paper, we show that the exponent set of nonnegative primitive tensors with order m(\geq 3) and dimension n is {1,2,\ldots, (n-1)^2+1}; and propose some open problems for further research.

Combinatorics · Mathematics 2014-08-18 Pingzhi Yuan , Zilong He , Lihua You

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

Combinatorics · Mathematics 2022-12-20 Heather Smith Blake , Piotr Micek , William T. Trotter

Let $P$ be a finite poset of width two, i.e., with no three-element antichain. We associate with $P$ a skew Young diagram $\Upsilon(P)$ and discuss some of the properties of the map $\Upsilon$. In particular, if we regard $\Upsilon(P)$ as a…

Combinatorics · Mathematics 2023-05-05 Richard P. Stanley

The celebrated Johnson-Lindenstrauss lemma states that for all $\varepsilon \in (0,1)$ and finite sets $X \subseteq \mathbb{R}^N$ with $n>1$ elements, there exists a matrix $\Phi \in \mathbb{R}^{m \times N}$ with…

Metric Geometry · Mathematics 2024-03-08 Rafael Chiclana , Mark A. Iwen , Mark Philip Roach

We prove that the number of single element extensions of $M(K_{n+1})$ is $2^{{n\choose n/2}(1+o(1))}$. This is done using a characterization of extensions as "linear subclasses".

Combinatorics · Mathematics 2021-11-15 Peter Nelson , Shayla Redlin , Jorn van der Pol

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

Combinatorics · Mathematics 2013-02-26 György Elekes , Endre Szabó

We consider labeled $r$-uniform hypertrees having $n \ge r \ge 2$ vertices. The number of hyperedges in such a hypertree is $m = (n - 1)/(r - 1)$. We show that there are exactly $f(n, r) = \frac{(n-1)! n^{m-1}}{(r-1)!^m m!}$ $r$-uniform…

Combinatorics · Mathematics 2018-12-18 Arjun Pitchanathan , Saswata Shannigrahi

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

Combinatorics · Mathematics 2024-12-11 Michael Neubauer , Harmony Vargas

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

Combinatorics · Mathematics 2023-03-10 Riccardo Aragona , Roberto Civino , Norberto Gavioli
‹ Prev 1 8 9 10 Next ›