相关论文: The Cube Recurrence

In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

In this paper we consider a general sequence of orthogonal Laurent polynomials on the unit circle and we first study the equivalences between recurrences for such families and Szego's recursion and the structure of the matrix representation…

This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…

By applying the recurrence approach and coupling constant metamorphosis, we construct higher order integrals of motion for the Stackel equivalents of the $N$-dimensional superintegrable Kepler-Coulomb model with non-central terms and the…

In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete…

In this paper, we study combinatorics of congruence subgroups of the modular group. More precisely, we consider the matrix equation that naturally arises in the theory of Coxeter friezes and investigate its irreducible solutions. We give…

In my 1993 paper, "Pappus's Theorem and the Modular Group", I explained how the iteration of Pappus's Theorem gives rise to a $2$-parameter family of representations of the modular group into the group of projective automorphisms. In this…

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

We describe a bijection between oriented cubes and adjoints of cross-polytopes. This correspondence is used to prove that the real affine cube is, up to reorientation in the same class, the unique oriented cube that is realizable. Moreover,…

Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…

We study the PBW filtration on irreducible finite--dimensional representations for the Lie algebra of type $\tt B_n$. We prove in several cases, including all multiples of the adjoint representation and all irreducible finite--dimensional…

In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let $(a,b)\in \mathbb{Z}^2$ and let $(x_n)_{n\ge 0}$ be the sequence defined by some initial values $x_0$ and $x_1$ and the second order…

We propose a new approach to extending the notion of commutator and Lie algebra to algebras with ternary multiplication laws. Our approach is based on ternary associativity of the first and second kind. We propose a ternary commutator,…

In the present note we study combinatorial and algebraic properties of cubic-line arrangements in the complex projective plane admitting nodes, ordinary triple and $A_{5}$ singular points. We deliver a Hirzebruch-type inequality for such…

We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…

The Ramanujan polynomials arise in three intertwined contexts. As remarked by BerndtEvans-Wilson, no combinatorial perspective seems to be alluded to in the original definition of Ramanujan. On a different stage, Dumont-Ramamonjisoa…

We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition…

The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.

C.M. Bender and G. V. Dunne showed that linear combinations of words $q^{k}p^{n}q^{n-k}$, where $p$ and $q$ are subject to the relation $qp - pq = \imath$, may be expressed as a polynomial in the symbol $z = \tfrac{1}{2}(qp+pq)$. Relations…