Related papers: Universal Cycles on Affine Lines
Linear codes in the projective space $\mathbb{P}_q(n)$, the set of all subspaces of the vector space $\mathbb{F}_q^n$, were first considered by Braun, Etzion and Vardy. The Grassmannian $\mathbb{G}_q(n,k)$ is the collection of all subspaces…
Let $f(x) \in \mathbb{Z}[x]$; for each integer $\alpha$ it is interesting to consider the number of iterates $n_{\alpha}$, if possible, needed to satisfy $f^{n_{\alpha}}(\alpha) = \alpha$. The sets $\{\alpha, f(\alpha), \ldots,…
For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the…
This note is about an old conjecture of Voisin, which concerns zero--cycles on the self-product of surfaces of geometric genus one. We prove this conjecture for surfaces with $p_g=1$ and $q=2$.
The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
We provide a combinatorial description of morphisms in the coherent sheaf category ${\rm coh}\mbox{-}\mathbb{X}(p,q)$ over weighted projective line of type $(p,q)$ via a marked annulus. This leads to a geometric realization of exceptional…
The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem.…
We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.
A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
The enhanced hypercube $Q_{n,k}$ is a variant of the hypercube $Q_n$. We investigate all the lengths of cycles that an edge of the enhanced hypercube lies on. It is proved that every edge of $Q_{n,k}$ lies on a cycle of every even length…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
We introduce moduli spaces of abelian varieties which are arithmetic models of Shimura varieties attached to unitary groups of signature (n-1, 1). We define arithmetic cycles on these models and study their intersection behaviour. In…
A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…
In this paper we detail a number of properties of the affine line of a derivator, including a number of morphisms between $\mathbb{D}$ and $\mathbb{A}^1_{\mathbb{D}}$, a monoidal structure on $\mathbb{A}^1_{\mathbb{D}}$ if $\mathbb{D}$ is…
In this paper we show that evolution algebras over any given field $\Bbbk$ are universally finite. In other words, given any finite group $G$, there exist infinitely many regular evolution algebras $X$ such that $Aut(X)\cong G$. The proof…
Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…
This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and…
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…