中文
相关论文

相关论文: Improving the $\frac{1}{3}-\frac{2}{3}$ Conjecture…

200 篇论文

Given a finite poset $\mathcal P$ and two distinct elements $x$ and $y$, we let $\operatorname{pr}_{\mathcal P}(x \prec y)$ denote the fraction of linear extensions of $\mathcal P$ in which $x$ precedes $y$. The balance constant…

组合数学 · 数学 2023-10-03 Evan Chen

The $1/3$-$2/3$ Conjecture, originally formulated in 1968, is one of the best-known open problems in the theory of posets, stating that the balance constant (a quantity determined by the linear extensions) of any non-total order is at least…

组合数学 · 数学 2024-09-17 Christian Gaetz , Yibo Gao

We revisit classic balancing problems for linear extensions of a partially ordered set $P$, proving results that go far beyond many of the best earlier results on this topic. For example, with $p(x\prec y)$ the probability that $x$ precedes…

组合数学 · 数学 2025-09-16 Max Aires , Jeff Kahn

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

组合数学 · 数学 2014-12-04 Samuel Fiorini , Selim Rexhep

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

组合数学 · 数学 2018-02-02 Emily J. Olson , Bruce E. Sagan

The main goal of the paper is to provide a quantitative lower bound greater than $1$ for the relative projection constant $\lambda(Y, X)$, where $X$ is a subspace of $\ell_{2p}^m$ space and $Y \subset X$ is an arbitrary hyperplane. As a…

泛函分析 · 数学 2017-10-02 Tomasz Kobos

The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…

组合数学 · 数学 2025-07-08 Albin Jaldevik , Jan Snellman

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) ] \ - \…

组合数学 · 数学 2021-11-30 Swee Hong Chan , Igor Pak , Greta Panova

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…

组合数学 · 数学 2016-06-27 Ross Berkowitz , Pat Devlin

Over the past 10 years, there has been considerable interest in exploring questions connecting dimension for posets with graph theoretic properties of their cover graphs and order diagrams, especially with the concepts of planarity and…

组合数学 · 数学 2023-04-18 Jędrzej Hodor , William T. Trotter

The cross--product conjecture (CPC) of Brightwell, Felsner and Trotter (1995) is a two-parameter quadratic inequality for the number of linear extensions of a poset $P= (X, \prec)$ with given value differences on three distinct elements in…

组合数学 · 数学 2022-12-05 Swee Hong Chan , Igor Pak , Greta Panova

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant $d$ such that if $P$ is a poset with cover graph of $P$ of pathwidth at most $2$, then $\dim(P)\leq d$. We answer this question in the affirmative by…

组合数学 · 数学 2015-07-07 Csaba Biró , Mitchel T. Keller , Stephen J. Young

Henrot and Lucardesi, in Commun. Contemp. Math. (2024), conjectured that among planar convex sets with prescribed minimal width, the equilateral triangle uniquely maximizes the Cheeger constant. In this short note, we confirm this…

最优化与控制 · 数学 2025-11-18 Ilias Ftouhi , Ilaria Lucardesi , Giorgio Saracco

Let $I(n,l)$ denote the maximum possible number of incidences between $n$ points and $l$ lines. It is well known that $I(n,l) = \Theta(n^{2/3}l^{2/3} + n + l)$. Let $c_{\mathrm{SzTr}}$ denote the lower bound on the constant of…

计算几何 · 计算机科学 2017-07-18 Roel Apfelbaum

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

信息论 · 计算机科学 2023-06-16 Jingbo Liu

We prove that every planar poset $P$ of height $h$ has dimension at most $192h + 96$. This improves on previous exponential bounds and is best possible up to a constant factor. We complement this result with a construction of planar posets…

组合数学 · 数学 2018-01-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…

组合数学 · 数学 2018-12-11 William T. Trotter , Bartosz Walczak , Ruidong Wang

In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…

代数几何 · 数学 2011-12-13 Bjoern Muetzel

The present manuscript aims to derive an expression for the lower bound of the modulus of the Dirichlet eta function on vertical lines $\Re(s)=\alpha$. The approach employs concepts of two-dimensional principal component analysis built on a…

综合数学 · 数学 2024-09-26 Yuri Heymann

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

组合数学 · 数学 2022-12-20 Adrian Dumitrescu , Csaba D. Tóth
‹ 上一页 1 2 3 10 下一页 ›