Related papers: Curious cyclic sieving on increasing tableaux

A general specialization map is constructed for higher Chow groups and used to prove a "going-up" theorem for algebraic cycles and their regulators. The results are applied to study the degeneration of the modified diagonal cycle of Gross…

Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…

An algebraic variety X is embedded to the order k via a line bundle L if the global sections of L generate all (simultaneous) jets of order k on X or if they separate all zero-dimensional subschemes of length at most k+1. Even though we…

We consider a two-parameter family of triangles whose $(n,k)$-th entry (counting the initial entry as the $(0,0)$-th entry) is the number of tilings of $N$-boards (which are linear arrays of $N$ unit square cells for any nonnegative integer…

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

We formulate a general problem: given projective schemes $\mathbb{Y}$ and $\mathbb{X}$ over a global field $K$ and a $K$-morphism $\eta$ from $\mathbb{Y}$ to $\mathbb{X}$ of finite degree, how many points in $\mathbb{X}(K)$ of height at…

The rational points of a smooth curve $X$ over a number field $k$ map to the set of augmentations of the associated motivic algebra. An expectation, related to Kim's conjecture, is that for $X$ hyperbolic, the set of augmentations which…

We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras. We show that each 2-cocycle on a higher-rank graph taking values in an abelian group…

In max algebra it is well-known that the sequence A^k, with A an irreducible square matrix, becomes periodic at sufficiently large k. This raises a number of questions on the periodic regime of A^k and A^k x, for a given vector x. Also,…

For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…

In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(\lambda)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if…

In this article we give a combinatorial formula for a certain class of Koornwinder polynomials, also known as Macdonald polynomials of type $\tilde{C}$. In particular, we give a combinatorial formula for the Koornwinder polynomials…

The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We study the injectivity property of certain actions of higher Chow groups on refined unramified cohomology. As an application for every $p\geq1$ and for each $d\geq p+4$ and $n\geq2,$ we establish the first examples of smooth complex…

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…

Let (k1,k2,k3,k4) be a quartet of cyclic cubic number fields sharing a common conductor c=pqr divisible by exactly three prime(power)s p,q,r. For those components k of the quartet whose 3-class group Cl(3,k) = Z/3Z x Z/3Z is elementary…

Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on $X+Y$, based on soft heaps, was introduced. By combining this approach with layer-ordered heaps (LOHs), an…

We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…