Related papers: Cyclicity and iterated logarithms in the Drury-Arv…
We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…
We give a sufficient condition for the ergodicity of the Lebesgue measure for an iterated function system of diffeomorphisms. This is done via the induced iterated function system on the space of continuum (which is called hyper-space). We…
In this paper, we study the cyclic vectors of the shift operator $S_b$ acting on de Branges-Rovnyak space $\mathcal H(b)$ associated to a non-extreme point of the closed unit ball of $H^\infty$. We highlight an interesting link with a…
Let $K$ be a complete discretely valued field of rank one, with residue field $\Q_p$. It is well known that period equals index in $\Br(K)$. We prove that when $p=2$ there exist noncyclic $K$-division algebras of every $2$-power degree…
In this paper, we introduce a natural class of multigraphs called hierarchical-scale-free (HSF) multigraphs, and consider constant-time testability on the class. We show that a very wide subclass, specifically, that in which the power-law…
A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…
Let $D$ be a strong digraph on $n\geq 4$ vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(y)\geq 2n-1$ and $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq…
We give a sufficient condition for two operators to be disjointly frequently hypercyclic. We apply this criterion to composition operators acting on $H(\mathbb D)$ or on the Hardy space $H^2(\mathbb D)$. We simplify a result on disjoint…
We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
In the scalar case, the spectral factorization mapping $f\to f^+$ puts a nonnegative integrable function $f$ having an integrable logarithm in correspondence with an outer analytic function $f^+$ such that $f = |f^+|^2$ almost everywhere.…
In this paper, necessary and sufficient conditions for a cyclic code of arbitrary length over the non-chain rings $Z_{4}+\nu Z_{4}$ for $\nu^{2} \in \{0,1,\nu,2\nu,3\nu,2+\nu,2+3\nu,3+2\nu\}$ to be a reversible cyclic code have been…
The cyclicity problem, crucial in analyzing planar vector fields, consists in estimating the number of limit cycles emanating from monodromic singularities. Traditionally, this estimation relies on Lyapunov coefficients. However, in…
We prove that a cyclic cover of a smooth complex projective variety is Brody hyperbolic if its branch divisor is a generic small deformation of a large enough multiple of a Brody hyperbolic base-point-free ample divisor. We also show the…
A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…
Dynamic logic is a modal logic for reasoning about programs. A cyclic proof system is a proof system that allows proofs containing cycles and is an alternative to a proof system containing (co-)induction. This paper introduces a sequent…
We prove that the maximal number of limit cycles which bifurcate from an open period annulus under a given multi-parameter analytic deformation of a given analytic vector field is the same as in an appropriate one-parameter analytic…
Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…
It is proved that for every $d\ge 2$ such that $d-1$ divides $q-1$, where $q$ is a power of 2, there exists a Denniston maximal arc $A$ of degree $d$ in $\PG(2,q)$, being invariant under a cyclic linear group that fixes one point of $A$ and…
It is proved that, if $(P_n)$ is a sequence of polynomials with complex coefficients having unbounded valences and tending to infinity at sufficiently many points, then there is an infinite dimensional closed subspace of entire functions,…