English
Related papers

Related papers: Restricted inversion sequences and enhanced $3$-no…

200 papers

We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…

Combinatorics · Mathematics 2012-02-29 Christian Krattenthaler , Thomas W. Müller

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

Andrews, Brietzke, R\o dseth and Sellers proved an infinite family of congruences on the number of the restricted $m$-ary partitions when $m$ is a prime. In this note, we show that these congruences hold for arbitrary positive integer $m$…

Combinatorics · Mathematics 2015-12-18 Qing-Hu Hou , Hai-Tao Jin , Yan-Ping Mu , Li Zhang

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

Combinatorics · Mathematics 2009-09-29 Olivier Guibert , Sylvain Pelat-Alloin

We study quasiconvex quadratic forms on $n \times m$ matrices which correspond to nonnegative biquadratic forms in $(n,m)$ variables. We disprove a conjecture stated by Harutyunyan--Milton (Comm. Pure Appl. Math. 70(11), 2017) as well as…

Algebraic Geometry · Mathematics 2022-04-25 Grigoriy Blekherman , Bogdan Raiţă , Isabelle Shankar , Rainer Sinn

In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…

Combinatorics · Mathematics 2007-05-23 Masao Ishikawa

A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges pairwise do not cross. Avis and Fukuda in 1996 proved that there always exists a flip sequence of length at most $2n-4$ between any pair of…

Computational Geometry · Computer Science 2023-11-01 Nicolas Bousquet , Lucas De Meyer , Théo Pierron , Alexandra Wesolek

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

Combinatorics · Mathematics 2007-05-23 S. Corteel , C. D. Savage

The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…

Computational Complexity · Computer Science 2020-04-06 Arun U

In this article we determine a generating set of rational invariants of minimal cardinality for the action of the orthogonal group $\mathrm{O}_3$ on the space $\mathbb{R}[x,y,z]_{2d}$ of ternary forms of even degree $2d$. The construction…

Symbolic Computation · Computer Science 2018-11-14 Paul Görlach , Evelyne Hubert , Théo Papadopoulo

We consider a variant of Stern's diatomic sequence, studied recently by Northshield. We prove that this sequence $b$ is invariant under \emph{digit reversal} in base $3$, that is, $b_n=b_{n^R}$, where $n^R$ is obtained by reversing the…

Number Theory · Mathematics 2017-09-19 Lukas Spiegelhofer

We use Naito-Sagaki's work [S. Naito & D. Sagaki, J. Algebra 245 (2001) 395--412, J. Algebra 251 (2002) 461--474] on Lakshmibai-Seshadri paths fixed by diagram automorphisms to study the partitions fixed by Mullineux involution. We…

Representation Theory · Mathematics 2007-05-23 Jun Hu

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire

The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a very expressive qualitative calculus for directional information of extended objects. Early work has shown that consistency checking of complete networks of basic…

Artificial Intelligence · Computer Science 2010-11-05 Weiming Liu , Sanjiang Li

The present work develops certain analytical tools required to construct and compute invariant kernels on the space of complex covariance matrices. The main result is the $\mathrm{L}^1$--Godement theorem, which states that any invariant…

Functional Analysis · Mathematics 2025-04-17 Salem Said , Franziskus Steinert , Cyrus Mostajeran

Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…

Probability · Mathematics 2018-09-26 Jean-Jil Duchamps , Amaury Lambert

In this paper, we present a reduction algorithm which transforms $m$-regular partitions of $[n]=\{1, 2, ..., n\}$ to $(m-1)$-regular partitions of $[n-1]$. We show that this algorithm preserves the noncrossing property. This yields a simple…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Eva Y. P. Deng , Rosena R. X. Du

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Combinatorics · Mathematics 2008-12-04 Zhi-Wei Sun

Descending plane partitions, alternating sign matrices, and totally symmetric self-complementary plane partitions are equinumerous combinatorial sets for which no explicit bijection is known. In this paper, we isolate a subset of descending…

Combinatorics · Mathematics 2017-04-20 Colton Keller , Jessica Striker

In Evan and Hendel's recent proof of an outstanding conjecture on the resistance distances of a family of linear 3-trees, a key technique in the proof was calculating the recursion satisfied by a family of determinants. The underlying…

Combinatorics · Mathematics 2026-01-09 Russell Jay Hendel