相关论文: On the Young-Fibonacci insertion algorithm

Let $L(m,n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m\times n$ rectangle. It is a classical result that the partially ordered set $L(m,n)$ is rank-symmetric, rank-unimodal, and…

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…

We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction.…

We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…

Young tableaux are fundamental objects in algebraic combinatorics and representation theory, with operations such as promotion and jeu de taquin playing a central role in their structure and applications. While these operations are well…

For a poset $(P,\leqslant)$ we consider the first-order theory, that is defined by set $P$ and relation $\leqslant$. The problem of undecidability of combinatorial theories attracts significant attention. Recently A. Wires proved the…

We establish the existence of an involution on tabloids that is analogous to Schutzenberger's evacuation map on standard Young tableaux. We find that the number of its fixed points is given by evaluating a certain Green's polynomial at $q =…

Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…

The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

Lattices of compatibly embedded finite fields are useful in computer algebra systems for managing many extensions of a finite field $\mathbb{F}_p$ at once. They can also be used to represent the algebraic closure $\bar{\mathbb{F}}_p$, and…

In this work, we introduce new combinatorial objects called Dyck tableaux, which present a natural insertion algorithm. These tools may be useful to describe statistics which are relevant in the study of the physical model named PASEP.

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Young tableaux are classical combinatorial objects playing recurring and varied roles in representation theory, algebraic geometry and commutative algebra. This article is a short exposition on Young tableaux, written for the "WHAT IS...?"…

We show that the order on probability measures, inherited from the dominance order on the Young diagrams, is preserved under natural maps reducing the number of boxes in a diagram by $1$. As a corollary we give a new proof of the Thoma…

Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let $\mathcal{F}_d(n)$ denote the set of minimal permutations of length $n$ with $d$…

We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…

Let S be a compact connected oriented surface, whose boundary is connected or empty. A homology cylinder over the surface S is a cobordism between S and itself, homologically equivalent to the cylinder over S. The Y-filtration on the monoid…

Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on variations of a straightening process that expresses a filling of a Young diagram…

In bracket algebra, the calculation of invariant division and invariant Gr\"{o}bner basis proposed in \cite{li 2014} rely on straightening algorithm. Until now, there are at least three different types of straightening algorithms, among…