English
Related papers

Related papers: The root posets and their rich antichains

200 papers

Let $\Phi$ be a finite crystallographic irreducible root system and $\mathcal P_{\Phi}$ be the convex hull of the roots in $\Phi$. We give a uniform explicit description of the polytope $\mathcal P_{\Phi}$, analyze the…

Combinatorics · Mathematics 2016-11-07 Paola Cellini , Mario Marietti

We investigate structural properties of the cone of roots of relative Steiner polynomials of convex bodies. We prove that they are closed, monotonous with respect to the dimension, and that they cover the whole upper half-plane, except the…

Metric Geometry · Mathematics 2011-12-21 Martin Henk , María A. Hernández Cifre , Eugenia Saorín

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

Number Theory · Mathematics 2024-11-12 Kevin O'Bryant

We show that picture groups are directly related to maximal green sequences for valued Dynkin quivers of finite type. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without…

Representation Theory · Mathematics 2025-06-25 Kiyoshi Igusa , Gordana Todorov

Let $X$ be a finite set, $Z \subseteq X$ and $y \notin X$. Marcel Ern\'{e} showed in 1981, that the number of posets on $X$ containing $Z$ as an antichain equals the number of posets $R$ on $X \cup \{ y \}$ in which the points of $Z \cup \{…

Combinatorics · Mathematics 2021-05-04 Frank a Campo

In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], a[1], ..., a[n]} and minimal extra-super increasing sequence…

Other Computer Science · Computer Science 2021-09-08 Shenghui Su , Jianhua Zheng , Shuwang Lv

In set theory without the Axiom of Choice (AC), we observe new relations of the following statements with weak choice principles. 1. Every locally finite connected graph has a maximal independent set. 2. Every locally countable connected…

Logic · Mathematics 2024-02-27 Amitayu Banerjee

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

Number Theory · Mathematics 2026-04-13 Ruofan Li

Let $G$ be a complex reductive group, $B$ be a Borel subgroup of G, $\nt$ be the Lie algebra of the unipotent radical of $B$, and $\nt^*$ be its dual space. Let $\Phi$ be the root system of $G$, and $\Phi^+$ be the set of positive roots…

Representation Theory · Mathematics 2014-10-16 Mikhail V. Ignatyev , Anton S. Vasyukhin

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…

Statistical Mechanics · Physics 2013-09-25 Ewan Colman , Geoff Rodgers

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or…

Combinatorics · Mathematics 2022-11-30 Eun-Kyung Cho , Jinha Kim , Minki Kim , Sang-il Oum

We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…

Combinatorics · Mathematics 2023-11-14 Joël Gay , Vincent Pilaud

Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mutually commuting reflections, a poset is described which plays a role in linear representatons of the corresponding Artin group A. The poset…

Group Theory · Mathematics 2007-05-23 A. M. Cohen , D. A. H. Gijsbers , D. B. Wales

Let $\mathscr{O}(P)$ and $\mathscr{C}(P)$ denote the order polytope and chain polytope, respectively, associated with a finite poset $P$. We prove the following result: if $P$ is a maximal ranked poset, then the number of triangular…

Combinatorics · Mathematics 2025-03-17 Aki Mori

A family ${\mathcal A} \subset {\mathcal P} [n]$ is said to be an antichain if $A \not \subset B$ for all distinct $A,B \in {\mathcal A}$. A classic result of Sperner shows that such families satisfy $|{\mathcal A}| \leq \binom {n}{\lfloor…

Combinatorics · Mathematics 2015-03-23 Eoin Long

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

Number Theory · Mathematics 2013-04-25 Javier Cilleruelo

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Daniel A. Spielman

An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…

Rings and Algebras · Mathematics 2026-05-26 Jason Bland , Skip Garibaldi , Joel Rosenberg

The notion of a $\delta$-generic sequence of P-points is introduced in this paper. It is proved assuming the Continuum Hypothesis that for each $\delta < {\omega}_{2}$, any $\delta$-generic sequence of P-points can be extended to an…

Logic · Mathematics 2016-07-26 Borisa Kuzeljevic , Dilip Raghavan