English
Related papers

Related papers: Stanley's conjectures on the Stern poset

200 papers

Let w be a binary string and let a_w (n) be the number of occurrences of the word w in the binary expansion of n. As usual we let s(n) denote the Stern sequence; that is, s(0)=0, s(1)=1, and for n >= 1, s(2n)=s(n) and s(2n+1)=s(n)+s(n+1).…

Number Theory · Mathematics 2011-07-08 Michael Coons , Jeffrey Shallit

In this paper, we prove that if $I\subset S:=K[x_1,...,x_n]$ is a monomial ideal then $I$ and $S/I$ satisfy the Stanley conjecture when $I$ has a small number of generators, with respect to $\depth(S/I)$ and $\max\{|P|:\;P\in\Ass(S/I)\}$.…

Commutative Algebra · Mathematics 2011-12-30 Mircea Cimpoeas

It is proved that a certain symmetric sequence of nonnegative integers arising in the enumeration of magic squares of given size n by row sums or, equivalently, in the generating function of the Ehrhart polynomial of the polytope of doubly…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis

We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a…

Commutative Algebra · Mathematics 2015-03-10 Lukas Katthän

Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by…

Discrete Mathematics · Computer Science 2014-10-16 Aldo de Luca , Alessandro De Luca

We prove several theorems concerning arithmetic properties of Stern polynomials defined in the following way: $B_{0}(t)=0, B_{1}(t)=1, B_{2n}(t)=tB_{n}(t)$, and $B_{2n+1}(t)=B_{n}(t)+B_{n+1}(t)$. We study also the sequence…

Combinatorics · Mathematics 2011-02-28 Maciej Ulas , Oliwia Ulas

We prove that the Stanley's conjecture holds for monomial ideals $I\subset K[x_1,...,x_n]$ generated by at most $2n-1$ monomials, i.e. $sdepth(I)\geq depth(I)$.

Commutative Algebra · Mathematics 2011-07-12 Mircea Cimpoeas

In this paper, we partially confirm a conjecture, proposed by Cimpoea\c{s}, Keller, Shen, Streib and Young, on the Stanley depth of squarefree Veronese ideals $I_{n,d}$. This conjecture suggests that, for positive integers $1 \le d \le n$,…

Commutative Algebra · Mathematics 2010-01-27 Maorong Ge , Jiayuan Lin , Yi-Huang Shen

Richard Stanley proved that the centralized/normalized version of the random variable "length of largest up-down subsequence" in a random permutation of length n is asymptotically normal. We go beyond and present a more refined asymptotic…

Combinatorics · Mathematics 2010-01-25 Shalosh B. Ekhad

This paper investgates Stanley-Reisner ideals with pure resolutions. We first describe two infinite families of such ideals associated to highly symmetric complexes. We then prove a partial analogue to the first Boij-S\"oderberg Conjecture…

Commutative Algebra · Mathematics 2024-09-13 David Carey , Mordechai Katzman

Let $I\supsetneq J$ be two monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . We study when the Stanley Conjecture holds for $I/J$ using the recent result of \cite{IKM} concerning the…

Commutative Algebra · Mathematics 2014-04-25 Dorin Popescu

A natural unit interval order is a naturally labelled partially ordered set that avoids patterns ${\bf 3} + {\bf 1}$ and $\bf 2 + 2$. To each natural unit interval order one can associate a symmetric function. The Stanley-Stembridge…

Combinatorics · Mathematics 2024-04-23 Joseph McDonough , Pavlo Pylyavskyy , Shiyun Wang

Let p(n) denote the number of unrestricted partitions of n. For i=0, 2, let p[i](n) denote the number of partitions pi of n such that O(pi) - O(pi') = i mod 4. Here O(pi) denotes the number of odd parts of the partition pi and pi' is the…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

We extend the notion of chain algebra, originally defined in \cite{GN} for finite distributive lattices, to that of finite pure posets. We show this algebra corresponds to the Ehrhart ring of a (0,1)-polytope, termed the chain polytope, and…

Combinatorics · Mathematics 2025-05-21 Dancheng Lu

The Neggers-Stanley conjecture (also known as the Poset conjecture) asserts that the polynomial counting the linear extensions of a partially ordered set on $\{1,2,...,p\}$ by their number of descents has real zeros only. We provide…

Combinatorics · Mathematics 2012-04-18 Petter Brändén

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

Discrete Mathematics · Computer Science 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…

Combinatorics · Mathematics 2017-07-11 Richard A. Moy , David Rolnick

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…

Combinatorics · Mathematics 2015-12-31 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

We prove that the Stern diatomic sequence is asymptotically distributed according to a normal law, on a logarithmic scale. This is obtained by studying complex moments, and the analytic properties of a transfer operator.

Number Theory · Mathematics 2019-05-07 Sandro Bettin , Sary Drappeau , Lukas Spiegelhofer

Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…

Combinatorics · Mathematics 2007-12-21 Amarpreet Rattan