Related papers: Beyond Conway's concyclicity theorem: generalizati…
We present an axiomatization of Conway theories which yields,as a corollary, a very concise axiomatization of iteration theories satisfying the functorial implication for base morphisms.
We prove that for any prime $\ell$, any finite group has as many irreducible complex characters of degree prime to $\ell$ as the normalizers of its Sylow $\ell$-subgroups. This equality was conjectured by John McKay. The conjecture was…
This paper introduces the class of "strongly endotactic networks", a subclass of the endotactic networks introduced by G. Craciun, F. Nazarov, and C. Pantea. The main result states that the global attractor conjecture holds for…
In this paper we introduce a new homology theory devoted to the study of families such as semi-algebraic or subanalytic families and in general to any family definable in an o-minimal structure (such as Denjoy-Carleman definable or $ln-exp$…
The well-known Conley's theorem states that the complement of chain recurrent set equals the union of all connecting orbits of the flow $\phi$ on the compact metric space $X$, i.e. $X-\mathcal{CR}(\phi)=\bigcup [B(A)-A]$, where…
We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…
An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…
We consider families of planar polynomial vector fields of degree $n$ and study the cyclicity of a type of unbounded polycycle~$\Gamma$ called hemicycle. Compactified to the Poincar\'e disc,~$\Gamma$ consists of an affine straight line…
The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…
In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…
Group counterfactual explanations find a set of counterfactual instances to explain a group of input instances contrastively. However, existing methods either (i) optimize counterfactuals only for a fixed group and do not generalize to new…
A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…
The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…
The disproved Nash Williams conjecture states that every 4-regular 4-connected graph has a hamiltonian cycle. We show that a modification of this conjecture is equivalent to the Dominating Cycle Conjecture.
The so called $q$-triplets were conjectured in 2004 and then found in nature in 2005. A relevant further step was achieved in 2005 when the possibility was advanced that they could reflect an entire infinite algebra based on combinations of…
A smooth complex variety satisfies the Generalized Jacobian Conjecture if all its \'etale endomorphisms are proper. We study the conjecture for $\mathbb{Q}$-acyclic surfaces of negative Kodaira dimension. We show that $G$-equivariant…
We show that for each \alpha>0 every sufficiently large oriented graph G with \delta^+(G),\delta^-(G)\ge 3|G|/8+ \alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen. In fact, we prove the…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The…
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…