Related papers: Universal Cycles on Affine Lines
After recalling the definition of Grassmann algebra and elements of Grassmann--Berezin calculus, we use the expression of Pfaffians as Grassmann integrals to generalize a series of formulas relating generating functions of paths in digraphs…
We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due…
A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…
Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two…
We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…
Let $\text{PG}(n,q)$ be the Desarguesian projective space of dimension $n$ over the finite field of order $q$. The \emph{linear representation} of a point set $\mathcal{K}$ in a hyperplane at infinity of $\text{PG}(n,q)$ is the point-line…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…
Let $K$ be a finite field extension of $Q_p$ and let $G_K$ be its absolute Galois group. We construct the universal family of filtered $(\phi,N)$-modules, or (more generally) the universal family of $(\phi,N)$-modules with a Hodge-Pink…
A number of applications of Steiner triple systems (e.g. disk erasure codes) exist that require a special ordering of its blocks. Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, and Gray codes are examples of listing…
Let $X$ be a general complete intersection of a given multi-degree in a complex projective space. Suppose that the anti-canonical line bundle of $X$ is ample. Using the cylinder homomorphism associated with the family of complete…
We prove a global Torelli theorem for pairs (Y,D), where Y is a smooth projective rational surface and D is an effective anti-canonical divisor which is a cycle of rational curves. This Torelli theorem was conjectured by Friedman in 1984.…
We construct an infinitesimal invariant for cycles in a family with cohomology class in the total space lying in a given level of the Leray filtration. This infinitesimal invariant detects cycles modulo algebraic equivalence in the fibers.…
The universal enveloping algebra of ${\cal W}_{1+\infty}$ is isomorphic to the affine Yangian of $\mathfrak{gl}_1$. We study the ${\cal N}=2$ supersymmetric version of this correspondence, and identify the full set of defining relations of…
Phenomenological scaling arguments suggest the existence of universal amplitudes in the finite-size scaling of certain correlation lengths in strongly anisotropic or dynamical phase transitions. For equilibrium systems, provided that…
An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…
Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex…
Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric…