Related papers: Promotion and cyclic sieving via webs
The Coble cubics were discovered more than a century ago in connection with genus two Riemann surfaces and theta functions. They have attracted renewed interest ever since. Recently, they were reinterpreted in terms of alternating…
The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrated a cyclic sieving phenomenon on generalized cluster…
It is noted that two-by-two S-matrices in multilayer optics can be represented by the Sp(2) group whose algebraic property is the same as the group of Lorentz transformations applicable to two space-like and one time-like dimensions. It is…
In an attempt to prove the Graceful Tree Conjecture, we present two propagation of graphs. The first is to propagate graceful graphs, and the second is to propagate trees from a gracefully labeled tree. The motivation in propagating such…
We show that the Humbert surfaces rationally generate the Picard groups of Siegel modular threefolds.
Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We define…
We exhibit large families of K3 surfaces with real multiplication, both abstractly using lattice theory, the Torelli theorem and the surjectivity of the period map, as well as explicitly using dihedral covers and isogenies.
The notion of descent set, for permutations as well as for standard Young tableaux (SYT), is classical. Cellini introduced a natural notion of {\em cyclic descent set} for permutations, and Rhoades introduced such a notion for SYT --- but…
Web graphs form a family of planar directed graphs with boundary that can be used to model quantum $\mathfrak{sl}_n$-invariant vectors. Standard Young tableaux on an $n \times k$ rectangle naturally index a basis for $\mathfrak{sl}_n$ web…
We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…
We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…
We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…
After surveying some known properties of compact convex sets in the plane, we give a two rigorous proofs of the general feeling that supporting lines can be slide-turned slowly and continuously. Targeting a wide readership, our treatment is…
We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the `apparent contour' of a single projection to the projective plane. We deal with the case of tangent developables and of general…
In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
The big empirical success of group equivariant networks has led in recent years to the sprouting of a great variety of equivariant network architectures. A particular focus has thereby been on rotation and reflection equivariant CNNs for…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
We introduce and study an affine analogue of skew Young diagrams and tableaux on them. It turns out that the double affine Hecke algebra of type $A$ acts on the space spanned by standard tableaux on each diagram. It is shown that the…
It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…