English
Related papers

Related papers: Cyclic Descents for General Skew Tableaux

200 papers

We study diffeomorphisms that have one-parameter families of continuous symmetries. For general maps, in contrast to the symplectic case, existence of a symmetry no longer implies existence of an invariant. Conversely, a map with an…

Chaotic Dynamics · Physics 2012-06-21 H. R. Dullin , H. E. Lomeli , J. D. Meiss

Understanding the periodic and structural properties of permutation maps over residue rings such as $\mathbb{Z}_{p^k}$ is a foundational challenge in algebraic dynamics and pseudorandom sequence analysis. Despite notable progress in…

Number Theory · Mathematics 2025-06-26 Kai Tan , Chengqing Li

We study dilations of finite tuples of normal, completely positive and completely contractive maps (which we call CP-maps) acting on a von Neumann algebra, and commuting according to a graph G. We show that if G is acyclic, then a tuple…

Operator Algebras · Mathematics 2021-08-16 Alexander Vernik

Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the Erd\H{o}s--Szekeres theorem is known and empty triangles have been investigated. We introduce a…

Computational Geometry · Computer Science 2026-03-17 Helena Bergold , Joachim Orthaber , Manfred Scheucher , Felix Schröder

We construct a collection of higher Chow cycles on certain surfaces which degenerate to an arrangement of planes in general position. When its degree is 4, this construction gives a new explicit proof of the Hodge-D-Conjecture for a certain…

Algebraic Geometry · Mathematics 2021-06-08 Tokio Sasaki

We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…

Representation Theory · Mathematics 2025-07-30 Koushik Paul , Götz Pfeiffer

We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.…

Combinatorics · Mathematics 2017-03-13 David Bevan , Grahame Erskine , Robert Lewis

We introduce tableau stabilization, a new phenomenon and statistic on Young tableaux based on jeu de taquin. We investigate bounds for tableau stabilization, the shape of stabilized tableaux, and tableau stabilization as a permutation…

Combinatorics · Mathematics 2020-03-12 Connor Ahlbach

From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…

Combinatorics · Mathematics 2012-09-25 M. A. Fiol

The cyclic sieving phenomenon was introduced by Reiner, Stanton and White in 2004 as a generalization of Stembridge's $q=-1$ phenomenon. In a paper from 2008, Eu and Fu studied many occurrences of this phenomenon on the faces of the…

Combinatorics · Mathematics 2026-03-31 Lucas Pouillart

A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of…

Combinatorics · Mathematics 2015-12-21 Katerina Böhmová , Cristina Dalfó , Clemens Huemer

Suppose $\lambda$ and $\mu$ are integer partitions with $\lambda\supseteq\mu$. Kenyon and Wilson have introduced the notion of a cover-inclusive Dyck tiling of the skew Young diagram $\lambda\setminus\mu$, which has applications in the…

Combinatorics · Mathematics 2015-01-30 Matthew Fayers

The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…

Classical Analysis and ODEs · Mathematics 2023-01-02 Romanos Diogenes Malikiosis

Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…

Combinatorics · Mathematics 2022-02-04 Sami Assaf , Stephanie van Willigenburg

We propose to imagine that every Riemannian metric on a surface is discrete at the small scale, made of curves called walls. The length of a curve is its number of wall crossings, and the area of the surface is the number of crossings of…

Differential Geometry · Mathematics 2020-09-08 Marcos Cossarini

The bead model is a random point field on $\mathbb{Z}\times\mathbb{R}$ which can be viewed as a scaling limit of dimer model. We prove that, in the scaling limit, the normalized height function of a uniformly chosen random bead…

Probability · Mathematics 2018-04-12 Wangru Sun

Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…

We develop the theory of n-stacks (or more generally Segal n-stacks which are $\infty$-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main…

Algebraic Geometry · Mathematics 2007-05-23 André Hirschowitz , Carlos Simpson

Fix an integer $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. We consider the specialized skew hook Schur polynomial $\text{hs}_{\lambda/\mu}(X,\omega X,\dots,\omega^{t-1}X/Y,\omega Y,\dots,\omega^{t-1}Y)$, where…

Combinatorics · Mathematics 2025-12-19 Nishu Kumari

The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the following problem: Given a digraph D, decide if there is a dicycle B…

Combinatorics · Mathematics 2011-06-30 Jørgen Bang-Jensen , Matthias Kriesell , Alessandro Maddaloni , Sven Simonsen
‹ Prev 1 4 5 6 7 8 10 Next ›