Related papers: The Cube Recurrence
We introduce a series of $\Z_2^n$-graded quasialgebras $\bbP_n(m)$ which generalizes Clifford algebras, higher octonions, and higher Cayley algebras. The constructed series of algebras and their minor perturbations are applied to contribute…
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
We show that the Poincare polynomial associated with the orbifold cell decomposition of the moduli space of smooth algebraic curves with distinct marked points satisfies a topological recursion formula of the Eynard-Orantin type. The…
In this paper we study sequences of lattices which are, up to similarity, projections of $\mathbb{Z}^{n+1}$ onto a hyperplane $\bm{v}^{\perp}$, with $\bm{v} \in \mathbb{Z}^{n+1}$ and converge to a target lattice $\Lambda$ which is…
A $r$-parameter ${u}_{\{\kappa_1, \kappa_2, \cdots, \kappa_r\}}(2)$ algebra is introduced. Finite unitary representations are investigated. This polynomial algebra reduces via a contraction procedure to the generalized Weyl-Heisenberg…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…
It is known that the combinatorial classes in the cohomology of the mapping class group of punctures surfaces defined by Witten and Kontsevich are polynomials in the adjusted Miller-Morita-Mumford classes. The leading coefficient was…
It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…
We give an elementary geometric re-proof of a formula discovered by Michel Brion as well as two variants thereof. A subset of R^n gives rise to a formal Laurent series with monomials corresponding to lattice points in the set. Under…
In this paper, we study the combinatorics of congruence subgroups of the modular group by generalizing results obtained in the non-modular case. For this, we define a notion of irreducible solutions from which we can build all the…
We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
We define and investigate a new three-parameter family of graphs that further generalizes the Fibonacci and metallic cubes. Namely, the number of vertices in this family of graphs satisfies Horadam recurrence, a linear recurrence of second…
The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over $\mathbb{C}$ and $\mathbb{R}$ in 1906--1907. The analogous problem for…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
A well-known problem in Algebraic Combinatorics, is the enumeration of circulant graphs. The failure of Adam's Conjecture for such graphs with order containing a repeated prime, led researchers to investigate the problem using two different…
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…
Based on Hopf algebra of rooted trees introduced by Connes and Kreimer, we construct a class of linear maps on noncommutative polynomial algebra in two indeterminates, namely rooted tree maps. We also prove that their maps induce a class of…