English
Related papers

Related papers: Combinatorial Reciprocity for Monotone Triangles

200 papers

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…

Combinatorics · Mathematics 2010-08-04 Ilse Fischer

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

Complex Variables · Mathematics 2017-04-04 Keisuke Uchimura

An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…

Combinatorics · Mathematics 2007-05-23 David P. Robbins

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Combinatorics · Mathematics 2025-11-06 Owen John Levens

Mills, Robbins, and Rumsey conjectured, and Zeilberger proved, that the number of alternating sign matrices of order $n$ equals $A(n):={{1!4!7! ... (3n-2)!} \over {n!(n+1)! ... (2n-1)!}}$. Mills, Robbins, and Rumsey also made the stronger…

Combinatorics · Mathematics 2008-02-03 Doron Zeilberger

We consider the tiling of an $n$-board (a board of size $n\times1$) with squares of unit width and $(1,1)$-fence tiles. A $(1,1)$-fence tile is composed of two unit-width square subtiles separated by a gap of unit width. We show that the…

Combinatorics · Mathematics 2022-02-02 Kenneth Edwards , Michael A. Allen

An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…

Statistical Mechanics · Physics 2007-08-21 M. Baiesi , E. Orlandini , A. L. Stella

We investigate the convex hulls of the eight dihedral symmetry classes of $n \times n$ alternating sign matrices, i.e., ASMs invariant under a subgroup of the symmetry group of the square. Extending the prefix-sum description of the ASM…

Combinatorics · Mathematics 2026-02-23 Péter Madarasi

We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N,E) where N is a (so called) ``neutral'' alternating sign matrix (with one -1) and E is an integer. The bijection preserves the classical…

Combinatorics · Mathematics 2007-05-23 Pierre Lalonde

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

Number Theory · Mathematics 2011-04-11 Lenny Jones

Reciprocal matrices are tridiagonal matrices $(a_{ij})_{i,j=1}^n$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For these matrices, criteria are established under which their Kippenhahn curves…

Functional Analysis · Mathematics 2024-07-02 Muyan Jiang , Ilya M. Spitkovsky

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

Number Theory · Mathematics 2021-11-24 Peter Illig , Rafe Jones , Eli Orvis , Yukihiko Segawa , Nick Spinale

There is the same number of $n \times n$ alternating sign matrices (ASMs) as there is of descending plane partitions (DPPs) with parts no greater than $n$, but finding an explicit bijection is an open problem for about $40$ years now. So…

Combinatorics · Mathematics 2022-12-05 Florian Aigner , Ilse Fischer

An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…

Number Theory · Mathematics 2022-12-14 Melvyn B. Nathanson

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Number Theory · Mathematics 2024-11-07 Antonio Cafure , Eda Cesaratto

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all…

Number Theory · Mathematics 2026-05-12 Cristina Ballantine , George Beck , Brooke Feigon , Kathrin Maurischat

For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…

Number Theory · Mathematics 2013-11-01 Zhi-Wei Sun

A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…

Combinatorics · Mathematics 2012-07-26 Nour-Eddine Fahssi