English
Related papers

Related papers: The spiders $S(4m+2,\,2m,\,1)$ are $e$-positive

200 papers

We prove that for any tree with a vertex of degree at least six, its chromatic symmetric function is not $e$-positive, that is, it cannot be written as a nonnegative linear combination of elementary symmetric functions. This makes…

Combinatorics · Mathematics 2022-05-17 Kai Zheng

In 2020, Dahlberg, She, and van Willigenburg conjectured that the chromatic symmetric function of any tree with maximum degree at least 4 is not e-positive. Zheng and Tom verified this conjecture for all trees with maximum degree at least 5…

Combinatorics · Mathematics 2026-02-11 Ethan Y. H. Li

We investigate the $e$-positivity and Schur positivity of the chromatic symmetric functions of some spider graphs with three legs. We obtain the positivity classification of all broom graphs and that of most double broom graphs. The methods…

Combinatorics · Mathematics 2021-12-14 David G. L. Wang , Monica M. Y. Wang

- A hamiltonian graph $G$ verifying $e(G)>n(k-1)/2$ %with a vertex of degree greater or equal than $k$ contains any $k$-spider. - If $G$ is a graph with average degree $\bar{d} > k-1$, then every spider of size $k$ is contained in $G$ for…

Combinatorics · Mathematics 2017-06-13 Camino Balbuena , Mucuy-Kak Guevara , José R. Portillo , Pedro Reyes

A spider consists of several, say $N$, particles. Particles can jump independently according to a random walk if the movement does not violate some given restriction rules. If the movement violates a rule it is not carried out. We consider…

Probability · Mathematics 2015-03-13 Christophe Gallesco , Sebastian Muller , Serguei Popov , Marina Vachkovskaia

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Group Theory · Mathematics 2021-12-06 Robert Lin

A classical result by Kreweras (1965) allows one to compute the number of plane partitions of a given skew shape and bounded parts as certain determinants. We prove that these determinants expand as polynomials with nonnegative…

Combinatorics · Mathematics 2025-04-15 Luis Ferroni , Alejandro H. Morales , Greta Panova

Let $E \subset \mathbb R^d$, $d \ge 2$, be compact, and let $\phi(x,y)$ be a smooth function satisfying the Phong--Stein rotational curvature condition on $\{\phi(x,y)=1\}$. We prove that if $\dim_{\mathcal H}(E)>1$, then $$…

Classical Analysis and ODEs · Mathematics 2026-05-28 Alex Iosevich , Zhangze Li , Krystal Taylor

Given a sequence $s=(s_1,s_2,\ldots)$ of positive integers, the inversion sequences with respect to $s$, or $s$-inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence…

Combinatorics · Mathematics 2013-10-22 William Y. C. Chen , Alan J. X. Guo , Peter L. Guo , Harry H. Y. Huang , Thomas Y. H. Liu

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

Combinatorics · Mathematics 2016-05-06 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar

We establish the $e$-positivity of cycle-chord graphs by using the composition method which is developed by Zhou and the author recently. Our method is simpler than the $(e)$-positivity approach which is used for handling cycle-chords with…

Combinatorics · Mathematics 2025-01-09 David G. L. Wang

For any integer $n \geq 2$, let $(m_{1},\ldots,m_{n})$ be a strictly increasing $n$-tuple of positive integers. We show that any subset $A\subset [N]^n$ of density at least $(\log N)^{-c}$ contains a nontrivial configuration of the form…

Number Theory · Mathematics 2026-05-08 Jingwei Guo , Changxing Miao , Guoqing Zhan

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Combinatorics · Mathematics 2012-09-05 Sara Billey , Krzysztof Burdzy , Bruce Sagan

Using the theory of signatures of hermitian forms over algebras with involution, developed by us in earlier work, we introduce a notion of positivity for symmetric elements and prove a noncommutative analogue of Artin's solution to…

Rings and Algebras · Mathematics 2016-09-28 Vincent Astier , Thomas Unger

In this paper we search for conditions on a countably compact (pseudo-compact) topological semigroup under which: (i) each maximal subgroup $H(e)$ in $S$ is a (closed) topological subgroup in $S$; (ii) the Clifford part $H(S)$(i.e. the…

General Topology · Mathematics 2009-07-22 Oleg V. Gutik , Dušan Pagon , Dušan Repovš

Let $(M,I,J,K)$ be a hyperkaehler manifold, $\dim_\R M =4n$. We study positive, Dolbeault-closed $(2p,0)$-forms on $(M,I)$. These forms are quaternionic analogues of the positive $(p,p)$-forms. We construct an injective homomorphism mapping…

Complex Variables · Mathematics 2010-06-29 Misha Verbitsky

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

Number Theory · Mathematics 2009-10-03 Oriol Serra , Gilles Zémor

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

Symbolic Computation · Computer Science 2025-03-19 Alaa Ibrahim

Schubert coefficients $c_{u,v}^w$ are structure constants describing multiplication of Schubert polynomials. Deciding positivity of Schubert coefficients is a major open problem in Algebraic Combinatorics. We prove a positive rule for this…

Combinatorics · Mathematics 2024-12-30 Igor Pak , Colleen Robichaux

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

Number Theory · Mathematics 2020-04-16 S. S. Rout , N. K. Meher
‹ Prev 1 2 3 10 Next ›