Related papers: Cyclic Descents for General Skew Tableaux

Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…

We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…

Esnault-Viehweg developed the theory of cyclic branched coverings $\tilde X\to X$ of smooth surfaces providing a very explicit formula for the decomposition of $H^1(\tilde X,\mathbb{C})$ in terms of a resolution of the ramification locus.…

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is…

We prove the Gersten conjecture for $p$-adic \'etale Tate twists for a smooth scheme $X$ in mixed characteristic in the Nisnevich topology. Our main observation is that, while $p$-adic \'etale Tate twists are not $\mathbb A^1$-invariant,…

In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the normalized variance, $V/E^2$, is bounded if and only if a certain…

We study experiment design for unique identification of the causal graph of a simple SCM, where the graph may contain cycles. The presence of cycles in the structure introduces major challenges for experiment design as, unlike acyclic…

We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…

We study skew-maps given by a minimal homeomorphism on the basis and a cocycle of affine isometries on the fibers. We call such a map a cylindrical vortex. We extend to this setting some classical results of Atkinson, Besicovitch,…

A cyclic $n$-gonal surface is a compact Riemann surface $X$ of genus $g\geq 2$ admitting a cyclic group of conformal automorphisms $C$ of order $n$ such that the quotient space $X/C$ has genus 0. In this paper, we provide an overview of…

We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone…

Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…

Discrete strip-concave functions considered in this paper are, in fact, equivalent to an extension of Gelfand-Tsetlin patterns to the case when the pattern has a not necessarily triangular but convex configuration. They arise by releasing…

This work continues the study of tiling billiards, a class of dynamical system introduced by Davis et al. in 2018. We develop the study of generalized tiling billiards in a cyclic polygon. This work shows that the behavior of generalized…

Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula (NHLF) as a positive sum over excited diagrams of products of…

Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of…

The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…

Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient…

In 1996, Reed, Robertson, Seymour and Thomas [Combinatorica 1996] proved Younger's Conjecture, which states that, for all directed graphs $D$, there exists a function $f$ such that, if $D$ does not contain $k$ disjoint cycles, then $D$…