Related papers: Universal Cycles on Affine Lines
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
Let $\mathfrak{g}$ be a complex simple Lie algebra and $U_q(\hat{\mathfrak{g}})$ the corresponding quantum affine algebra. We prove that every irreducible finite-dimensional $U_q(\hat{\mathfrak{g}})$-module gives rise to a family of…
In a binary groupoid $(G, *)$, a Fibonacci sequence is a recurrent sequence defined by $f_1 = a, f_2 = b, \ldots, f_n = f_{n - 2} * f_{n - 1}$. A universal Fibonacci sequence (UFS) is a singly or doubly infinite sequence whose set of…
We provide two alternate settings for a family of varieties modeling the uniserial representations with fixed sequence of composition factors over a finite dimensional algebra. The first is a quasi-projective subvariety of a Grassmannian…
We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some ${\rm Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.
We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it…
We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…
We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases,…
An exceptional cycle in a triangulated category with Serre functor is a generalization of a spherical object. Suppose that $A$ and $B$ are Gorenstein algebras, given a perfect exceptional $n$-cycle $E_*$ in $K^b(A\mbox{-}{\rm proj})$ and a…
The goal of this article is to study some basic algebraic and combinatorial properties of "generalized $n$-series" over a commutative ring $R$, which are functions $s: \mathbf{Z}_{\geq 0} \to R$ satisfying a mild condition. A special…
We present quantum circuits with a brick wall structure using the optimal number of parameters and two-qubit gates to parametrize $SU(2^n)$, and provide evidence that these circuits are universal for $n\leq 5$. For this, we successfully…
We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…
A bar framework (G,p) in dimension r is a graph G whose vertices are points p^1,...,p^n in R^r and whose edges are line segments between pairs of these points. Two frameworks (G,p) and (G,q) are equivalent if each edge of (G,p) has the same…
Let $\mathbb {F}_q$ be finite field with $q$ elements. Let $\alpha\leqslant n$ be positive integers. Consider the general linear group $\mathrm{GL}(\alpha+n, \mathbb {F}_q) $ and its subgroup $H(n)$, which fixes the first $\alpha$ basis…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph $K_n$ admits a plane Hamiltonian cycle. It turned out that already the existence of much simpler non-crossing substructures in such drawings is hard to…
A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study…
The universal scheme of clusters of sections is an adaption of Kleiman's iterated blow ups (which parametrise clusters of points) to parametrise clusters of sections. They can also be constructed iteratively, but the iterative step is not…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
We show that if a polyhedron in the three-dimensional affine space with triangular faces is flexible, i.e., can be continuously deformed preserving the shape of its faces, then there is a cycle of edges whose lengths sum up to zero once…