中文
相关论文

相关论文: The proof of the removable pair conjecture for fra…

200 篇论文

The original notion of dimension for posets was introduced by Dushnik and Miller in 1941 and has been studied extensively in the literature. In 1992, Brightwell and Scheinerman developed the notion of fractional dimension as the natural…

组合数学 · 数学 2020-10-20 Heather C. Smith , William T. Trotter

Motivated by the study of the dimension of random posets, it was conjectured by Bollob\'as and Brightwell in 1997 that if $P$ is a finite poset whose cover graph contains at most one cycle then its order dimension is at most $3$. In this…

组合数学 · 数学 2025-05-23 Antoine Abram , Adrien Segovia

In $1941$ Dushnik and Miller introduced the concept of dimension of a poset. In $2020$ Bhavale and Waphare introduced the concept of an RC-lattice as a lattice in which all the reducible elements are lying on a chain. In this paper, we…

组合数学 · 数学 2025-09-11 Ashok Nivrutti Bhavale

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 dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a variation called local dimension which makes use of partial…

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

In 1967 L. Auslander conjectured that every crystallographic subgroup of an affine group is virtually solvable, i.e. contains a solvable subgroup of finite index. D. Fried and W. Goldman proved Auslander's conjecture for affine space of…

群论 · 数学 2013-06-04 Herbert Abels , Gregory Margulis , Gregory Soifer

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such…

组合数学 · 数学 2018-12-21 David M. Howard , Noah Streib , William T. Trotter , Bartosz Walczak , Ruidong Wang

It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar…

组合数学 · 数学 2018-12-11 Bartosz Walczak

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

In 1933, Borsuk conjectured that any bounded d-dimensional set of nonzero diameter can be broken into d + 1 parts of smaller diameter. This conjecture was disproved for large enough d, though it is true for low dimensional cases. The paper…

度量几何 · 数学 2010-10-12 Dian Yang

In 1977, Trotter and Moore proved that a poset has dimension at most $3$ whenever its cover graph is a forest, or equivalently, has treewidth at most $1$. On the other hand, a well-known construction of Kelly shows that there are posets of…

组合数学 · 数学 2016-05-05 Gwenaël Joret , Piotr Micek , William T. Trotter , Ruidong Wang , Veit Wiechert

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

组合数学 · 数学 2013-05-17 Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…

组合数学 · 数学 2022-09-15 Aenne Benjes

We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded height case can be reduced to checking that the conjecture…

组合数学 · 数学 2009-09-29 Francois Bergeron , Riccardo Biagioli , Mercedes H. Rosas

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

组合数学 · 数学 2007-05-23 Jonathan David Farley

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

数论 · 数学 2016-03-22 Christian Reiher

We prove that the conjecture made by Peter Frankl in the late 1970s is true. In other words for every finite union-closed family which contains a non?empty set, there is an element that belongs to at least half of its m

组合数学 · 数学 2024-05-08 Roberto Demontis

Robert Kaufman's proof that the set of rapid points of Brownian motion has a Fourier dimension equal to its Hausdorff dimension was first published in 1974. A study of the proof of the original paper revealed several gaps in the arguments…

概率论 · 数学 2015-04-24 Paul Potgieter

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…

数论 · 数学 2022-05-03 Doowon Koh , Minh Quy Pham , Thang Pham
‹ 上一页 1 2 3 10 下一页 ›