English
Related papers

Related papers: Lecture hall graphs and the Askey scheme

200 papers

This work applies the ideas of Alekseev and Meinrenken's Non-commutative Chern-Weil Theory to describe a completely combinatorial and constructive proof of the Wheeling Theorem. In this theory, the crux of the proof is, essentially, the…

Quantum Algebra · Mathematics 2019-12-19 Andrew Kricker

Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on…

Combinatorics · Mathematics 2007-06-13 Raymond Hemmecke , Jason Morton , Anne Shiu , Bernd Sturmfels , Oliver Wienand

In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…

Combinatorics · Mathematics 2023-11-21 Martin Dzúrik

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…

Combinatorics · Mathematics 2012-07-24 Natalie Aisbett

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

Combinatorics · Mathematics 2013-01-14 Yasuhide Numata , Akimichi Takemura

In this paper we produce seven new algebras as confluences of the Cherednik algebra of type \check{C_1}C_1 and we characterise their spherical-sub-algebras. The limit of the spherical sub-algebra of the Cherednik algebra of type…

Quantum Algebra · Mathematics 2015-10-20 Marta Mazzocco

We give a combinatorial model for F-polynomials and g-vectors for type D cluster algebras where the associated quiver is acyclic. Our model utilizes a combination of dimer configurations and double dimer configurations which we refer to as…

Combinatorics · Mathematics 2023-01-27 Gregg Musiker , Kayla Wright

In Parts I-III we showed that the number of ways to place $q$ nonattacking queens or similar chess pieces on an $n\times n$ chessboard is a quasipolynomial function of $n$ whose coefficients are essentially polynomials in $q$. In this part…

Combinatorics · Mathematics 2021-06-16 Seth Chaiken , Christopher R. H. Hanusa , Thomas Zaslavsky

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

Group Theory · Mathematics 2017-01-09 Florent Jouve , Jean-Sébastien Sereni

The goal of this article is to display a $Q$-polynomial structure for the Attenuated Space poset $\mathcal A_q(N,M)$. The poset $\mathcal A_q(N,M)$ is briefly described as follows. Start with an $(N+M)$-dimensional vector space $H$ over a…

Combinatorics · Mathematics 2024-07-02 Paul Terwilliger

We study the critical points of monomial functions over an algebraic subset of the probability simplex. The number of critical points on the Zariski closure is a topological invariant of that embedded projective variety, known as its…

Algebraic Geometry · Mathematics 2013-09-19 June Huh , Bernd Sturmfels

We give equivalent forms of the Askey-Wilson polynomials expressing them with the help of the Al-Salam-Chihara polynomials. After restricting parameters of the Askey-Wilson polynomials to complex conjugate pairs we expand the Askey-Wilson…

Classical Analysis and ODEs · Mathematics 2012-08-13 Paweł J. Szabłowski

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

Combinatorics · Mathematics 2021-02-04 Raymond Cheng , Eric Katz

In this paper, we study staircase tableaux, a combinatorial object introduced due to its connections with the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. Due to their interesting connections, staircase tableaux have…

Combinatorics · Mathematics 2015-09-21 Pawel Hitczenko , Amanda Lohss

For the class of quantum integrable models generated from the $q-$Onsager algebra, a basis of bispectral multivariable $q-$orthogonal polynomials is exhibited. In a first part, it is shown that the multivariable Askey-Wilson polynomials…

Mathematical Physics · Physics 2018-02-01 Pascal Baseilhac , Xavier Martin

We prove the combinatorial invariance of the coefficient of $q$ in Kazhdan--Lusztig polynomials for arbitrary Coxeter groups. As a result, we obtain the Combinatorial Invariance Conjecture, of Lusztig and of Dyer, also for Bruhat intervals…

Combinatorics · Mathematics 2026-02-26 Grant T. Barkley , Christian Gaetz , Thomas Lam

We apply the method of orbit harmonics to the set of break divisors and orientable divisors on graphs to obtain the central and external zonotopal algebras respectively. We then relate a construction of Efimov in the context of…

Combinatorics · Mathematics 2022-08-18 Markus Reineke , Brendon Rhoades , Vasu Tewari

Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…

Mathematical Physics · Physics 2014-01-07 Ernest G. Kalnins , Willard Miller

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli

We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…

Combinatorics · Mathematics 2011-06-08 Adam Bohn
‹ Prev 1 8 9 10 Next ›