Related papers: Y-systems and generalized associahedra
We prove that every orbit of the adjoint representation of any connected reductive algebraic group $G$ is a rational algebraic variety. For complex simply connected semisimple $G$, this implies rationality of affine Hamiltonian…
To test a possible relation between the topological entropy and the Arnold complexity, and to provide a non trivial example of a rational dynamical zeta function, we introduce a two-parameter family of two-dimensional discrete rational…
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…
Let $k$ be a field and $X$ be a set of $n$ elements. We introduce and study a class of quadratic $k$-algebras called \emph{quantum binomial algebras}. Our main result shows that such an algebra $A$ defines a solution of the classical…
This paper investigates the structure of generic motives and their implications for the motivic cohomology of fields. Originating in Voevodsky's theory of motives and related to Beilinson's vision of a motivic $t$-structure, generic motives…
It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr($\phi^3$) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note we describe a new class of…
In this work we give a full characterization of sets of multiple polynomial recurrence in Weyl systems, which are ergodic unipotent affine transformations on products of tori and finite abelian groups. In particular, we show that measurable…
Given a finite Coxeter system $(W,S)$ and a Coxeter element $c$, we construct a simple polytope whose outer normal fan is N. Reading's Cambrian fan $F_c$, settling a conjecture of Reading that this is possible. We call this polytope the…
We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron) introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is…
We propose a simple criterion to know if an abelian variety $A$ defined over a finite field $\mathbb{F}_q$ is cyclic, i.e., it has a cyclic group of rational points; this criterion is based on the endomorphism ring End$_{\mathbb{F}_q}(A)$.…
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups,…
We consider genera of polyhedra (finite cell complexes) in the stable homotopy category. Namely, the genus of a polyhedron X is the class of polyhedra Y such that all localizations of Y are stably isomorphic to the corresponding…
Starting from certain rational varieties blown-up from (P^1)^N, we construct a tropical, i.e., subtraction-free birational, representation of Weyl groups as a group of pseudo isomorphisms of the varieties. Furthermore, we develop an…
A theorem of A. and C. R\'enyi on periodic entire functions states that an entire function $f(z) $ must be periodic if $ P(f(z)) $ is periodic, where $ P(z) $ is a non-constant polynomial. By extending this theorem, we can answer some open…
These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of root systems, generalized associahedra, and the combinatorics of clusters. Lectures 1-2 cover classical material:…
In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…
Let $P\in\mathbb{P}_1(\mathbb{Q})$ be a periodic point for a monic polynomial with coefficients in $\mathbb{Z}$. With elementary techniques one sees that the minimal periodicity of $P$ is at most $2$. Recently we proved a generalization of…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…
Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…