Related papers: Restricted inversion sequences and enhanced $3$-no…
We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schr{\"o}der paths and Schr{\"o}der paths without peaks at even height. We also give a direct bijection between 2-distant…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
Over an arbitrary field of characteristic different from $2$ admitting an anisotropic torsion $3$-fold Pfister form, we apply a construction due to Merkurjev to produce an algebra with orthogonal involution of degree $6$ which admits proper…
We prove an identity about partitions with a very elementary formulation. We had previously conjectured this identity, encountered in the study of shifted Jack polynomials (math.CO/9901040). The proof given is using a trivariate generating…
We study a link between complete non-ambiguous trees (CNATs) and permutations exhibited by Daniel Chen and Sebastian Ohlig in recent work. In this, they associate a certain permutation to the leaves of a CNAT, and show that the number of…
For self-similar sets $X,Y\subseteq \mathbb{R}$, we obtain new results towards the affine embeddings conjecture of Feng-Huang-Rao (2014), and the equivalent weak intersections conjecture. We show that the conjecture holds when the defining…
It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…
We present a convolutional network that is equivariant to rigid body motions. The model uses scalar-, vector-, and tensor fields over 3D Euclidean space to represent data, and equivariant convolutions to map between such representations.…
We provide a wall-crossing framework for operational enumerative invariants of equivariant 3-Calabi--Yau categories arising from virtual cycles. The strategy follows ideas of Joyce's ``universal'' wall-crossing framework arXiv:2111.04694,…
All tree-level amplitudes in Einstein-Yang-Mills (EYM) theory and gravity (GR) can be expanded in terms of color ordered Yang-Mills (YM) ones whose coefficients are polynomial functions of Lorentz inner products and are constructed by a…
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
We study a correspondence between orientation reversing involutions on compact 3-manifolds with only isolated fixed points and binary, self-dual codes. We show in particular that every such code can be obtained from such an involution. We…
An increasing 1,2-tree is a labeled graph formed by starting with a vertex and then repeatedly attaching a leaf to a vertex or a triangle to an edge, the labeling of the vertices corresponding to the order in which the vertices are added.…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
In this paper, we consider chains of infinite order on countable state spaces with prohibited transitions. We give a set of sufficient conditions on the structure of the probability kernels of the chains to have at most one stationary…
Amdeberhan conjectured that the number of $(s,s+2)$-core partitions with distinct parts for an odd integer $s$ is $2^{s-1}$. This conjecture was first proved by Yan, Qin, Jin and Zhou, then subsequently by Zaleski and Zeilberger. Since the…
The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…
Preconditioned eigenvalue solvers offer the possibility to incorporate preconditioners for the solution of large-scale eigenvalue problems, as they arise from the discretization of partial differential equations. The convergence analysis of…