Related papers: Cyclicity and iterated logarithms in the Drury-Arv…

In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the…

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ denotes the subspace of $C(G)$, spanned by the…

A cyclic proof system allows us to perform inductive reasoning without explicit inductions. We propose a cyclic proof system for HFLN, which is a higher-order predicate logic with natural numbers and alternating fixed-points. Ours is the…

Jury and Martin establish an analogue of the classical inner-outer factorization of Hardy space functions. They show that every function $f$ in a Hilbert function space with a normalized complete Pick reproducing kernel has a factorization…

We introduce the concept of cyclicity and hypercyclicity in self-similar groups as an analogue of cyclic and hypercyclic vectors for an operator on a Banach space. We derive a sufficient condition for cyclicity of non-finitary automorphisms…

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

We study the cyclicity of vectors $u$ in $\ell^p(\mathbb{Z})$. It is known that a vector $u$ is cyclic in $\ell^2(\mathbb{Z})$ if and only if the zero set, $\mathcal{Z}(\widehat{u})$, of its Fourier transform, $\widehat{u}$, has Lebesgue…

Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…

We study the existence of a directed Hamilton cycle in random digraphs with $m$ edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $D_{n,m}^{(\delta\geq1)}$. We prove that if $m=\tfrac n2(\log…

Let $S_1, \cdots, S_N$ simple finite-dimensional modules of a quantum affine algebra. We prove that if $S_i\otimes S_j$ is cyclic for any $i < j$ (i.e. generated by the tensor product of the highest weight vectors), then $S_1\otimes \cdots…

For a prime number $\ell$, an isogeny class $\mathcal{A}$ of abelian varieties is called $\ell$-cyclic if every variety in $\mathcal{A}$ have a cyclic $\ell$-part of its group of rational points. More generally, for a finite set of prime…

A subspace of $\mathbb{F}_2^n$ is called cyclically covering if every vector in $\mathbb{F}_2^n$ has a cyclic shift which is inside the subspace. Let $h_2(n)$ denote the largest possible codimension of a cyclically covering subspace of…

In this survey, we consider Banach spaces of analytic functions in one and several complex variables for which: (i) polynomials are dense, (ii) point-evaluations on the domain are bounded linear functionals, and (iii) the shift operator…

For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…

Let D be the circulant digraph with n vertices and connection set {2,3,c}. (Assume D is loopless and has outdegree 3.) Work of S.C.Locke and D.Witte implies that if n is a multiple of 6, c is either (n/2) + 2 or (n/2) + 3, and c is even,…

Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponential complement operation for B\"uchi automata. Recently, we…

We examine the relationships between axiomatic and cyclic proof systems for the partial and total versions of Hoare logic and those of its dual, known as reverse Hoare logic (or sometimes incorrectness logic). In the axiomatic proof systems…

Let $\mathcal{L}$ be a language that can be decided in linear space and let $\epsilon >0$ be any constant. Let $\mathcal{A}$ be the exponential hardness assumption that for every $n$, membership in $\mathcal{L}$ for inputs of length~$n$…

Let $M$ be a closed, connected, orientable topological four-manifold with $H_1(M)$ nontrivial and free abelian, $b_2(M)\ne 0, 2$, and $\chi(M)\ne 0$. We show that if $G$ is a finite group of 2-rank $\le 1$ which admits a homologically…

We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…