Related papers: On the Zero Defect Conjecture
We prove an analogue of the Tate conjecture on homomorphisms of abelian varieties over infinite cyclotomic extensions of finitely generated fields of characteristic zero.
It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…
We prove the Conley conjecture for negative monotone, closed symplectic manifolds, i.e., the existence of infinitely many periodic orbits for Hamiltonian diffeomorphisms of such manifolds.
In this article, we study the permanence of topological and algebraic dimension type properties of simple unital $C\sp*$-algebras. When a pair of unital $C\sp*$-algebras $(A, B)$ is associated by a $*$-homomorphism $\phi: A\to B$ which is…
We study the failure of the Lipman-Zariski conjecture in positive characteristic. For rational double points, the conjecture holds true except for a short finite list of exceptions. For log canonical surface singularities, the conjecture…
The absolute sets of local systems on a smooth complex algebraic variety are the subject of a conjecture of N. Budur and B. Wang based on an analogy with special subvarieties of Shimura varieties. An absolute set should be the…
We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
We develop a systematic approach to continuous substitutions on compact Hausdorff alphabets. Focussing on implications of irreducibility and primitivity, we highlight important features of the topological dynamics of their (generalised)…
We consider the following conjecture: if X is a smooth projective variety over a field of characteristic zero, then there is a dense set of reductions X_s to positive characteristic such that the action of the Frobenius morphism on the top…
A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…
Let $f:X\rightarrow X$ be a quasi-finite endomorphism of an algebraic variety $X$ defined over a number field $K$ and fix an initial point $a\in X$. We consider a special case of the dynamical Mordell-Lang Conjecture, where the subvariety…
A theorem of Gao, Jackson and Seward, originally conjectured to be false by Glasner and Uspenskij, asserts that every countable group admits a $2$-coloring. A direct consequence of this result is that every countable group has a strongly…
We prove that the existence of an automorphism of finite order on a (defined over a number field) variety X implies the existence of algebraic linear relations between the logarithm of certain periods of X and the logarithm of special…
In the paper {\em The inversion formulae for automorphisms of polynomial algebras and differential operators in prime characteristic}, J. Pure Appl. Algebra 212 (2008), no. 10, 2320-2337, see also arXiv:math/0604477, Vladimir Bavula states…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
On every set A there is a rigid binary relation, i.e. such a relation R that there is no homomorphism (A,R)->(A,R) except the identity (Vopenka et al. [1965]). We state two conjectures which strengthen this theorem. We prove these…