Related papers: On the Zero Defect Conjecture
A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…
The Morse-Hedlund Theorem states that a bi-infinite sequence $\eta$ in a finite alphabet is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$. In dimension two,…
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 of X to positive characteristic such that the action of the Frobenius morphism on the…
The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$-edge-colourable graphs have defect $0$, those that cannot be $3$-edge-coloured (that is, snarks) are known…
We extend to binary relational systems the notion of compact and normal structure, introduced by J.P.Penot for metric spaces, and we prove that for the involutive and reflexive ones, every commuting family of relational homomorphisms has a…
We revisit the topic of power-free morphisms, focusing on the properties of the class of complementary morphisms. Such morphisms are defined over a $2$-letter alphabet, and map the letters 0 and 1 to complementary words. We prove that every…
We construct a Dirac morphism and prove that if this Dirac morphism is invertible, then the isomorphism conjecture for non-connective algebraic K-theory holds true.
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
Carroy, Miller, Schrittesser, and Vidny\'anszky established the $L_0$ dichotomy: there is a Borel graph of Borel chromatic number three that admits a continuous homomorphism to every analytic graph of Borel chromatic number at least three.…
Let $\Omega\subset \mathbb{R}^d$ be a set of finite measure. The periodic tiling conjecture suggests that if $\Omega$ tiles $\mathbb{R}^d$ by translations then it admits at least one periodic tiling. Fuglede's conjecture suggests that…
Scott proved in 1997 that for any tree $T$, every graph with bounded clique number which does not contain any subdivision of $T$ as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if $T$ is…
In this work we discuss whether the non-commuting graph of a finite group can determine its nilpotency. More precisely, Abdollahi, Akbari and Maimani conjectured that if $G$ and $H$ are finite groups with isomorphic non-commuting graphs and…
Let $G$ be a graph of order $n$ and $P(G,x)$ be the chromatic polynomial of $G$. Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that $\frac{d^k}{dx^k} \bigl( \ln[(-1)^n P(G, x)] \bigr) < 0$ holds for all $k…
A basic question concerning indecomposable Soergel bimodules is to understand their endomorphism rings. In characteristic zero all degree-zero endomorphisms are isomorphisms (a fact proved by Elias and the second author) which implies the…
This paper is concerned with the well known Jeffreys-Lindley paradox. In a Bayesian set up, the so-called paradox arises when a point null hypothesis is tested and an objective prior is sought for the alternative hypothesis. In particular,…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic…
We classify plethories over fields of characteristic zero, thus answering a question of Borger-Wieland and Bergman-Hausknecht. All plethories over characteristic zero fields are linear, in the sense that they are free plethories on a…