Related papers: Any counterexample to Makienko's conjecture is an …
We prove an effective form of Wilkie's conjecture in the structure generated by restricted sub-Pfaffian functions: the number of rational points of height $H$ lying in the transcendental part of such a set grows no faster than some power of…
We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…
We show that an invariant Fatou component of a hyperbolic transcendental entire function is a bounded Jordan domain (in fact, a quasidisc) if and only if it contains only finitely many critical points and no asymptotic curves. We use this…
We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…
We show that if a meromorphic function has a direct singularity over infinity, then the escaping set has an unbounded component and the intersection of the escaping set with the Julia set contains continua. This intersection has an…
We consider fixed points of the Feigenbaum (periodic-doubling) operator whose orders tend to infinity. It is known that the hyperbolic dimension of their Julia sets go to 2. We prove that the Lebesgue measure of these Julia sets tend to…
Following the ideas of A.~Douady, we give an alternative proof of the authors' result: for any boundary point $c_0$ of the Mandelbrot set $M$, we can find small quasiconformal copies of $M$ in $M$ that are encaged in nested quasiconformal…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…
We show that if a polynomial filled Julia set has empty interior, then it is computable.
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We show that for any transcendental meromorphic function $f$ there is a point $z$ in the Julia set of $f$ such that the iterates $f^n(z)$ escape, that is, tend to $\infty$, arbitrarily slowly. The proof uses new covering results for…
Let $B$ be a fixed rational function of one complex variable of degree at least two. In this paper, we study solutions of the functional equation $A\circ X=X\circ B$ in rational functions $A$ and $X$. Our main result states that, unless $B$…
All counterexamples of Pinchuk type to the strong real Jacobian conjecture are shown to have rational function field extensions of degree six with no nontrivial automorphisms.
We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…