Related papers: Complex analytic proofs of two probabilistic theor…
In 1984, Gehring and Pommerenke proved that if the Schwarzian derivative $S(f)$ of a locally univalent analytic function $f$ in the unit disk satisfies that $\limsup_{|z|\to 1} |S(f)(z)| (1-|z|^2)^2 < 2$, then there exists a positive…
We prove fractional boundary Hardy's inequality in dimension one for the critical case $sp =1$. Optimality of the inequality is obtained for any $p$. The extra logarithmic correction term appears in usual fashion. We also provide a concrete…
Let $G$ be a bounded simply connected domain in the complex plane. A point $a\in \partial G$ is said to be accessible from inside of $G$ if there is a Jordan arc $J$ such that $J\subset \bar G$ and $J\cap\partial G=\{a\}$. In this paper the…
The "openness" of a complex polynomial mapping is discussed and applied to the Fundamental Theorem of Algebra. In this category fall proofs of S. Wolfenstein, R.L. Thompson, J. Milnor, and S. Reich-S. Smale. These proofs take into account…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…
Theorems crucial in elementary real function theory have proofs in which compactness arguments are used. Despite the introduction in relatively recent literature of each new highly elegant compactness argument, or of an equivalent, this…
We study systems of functional equations whose solutions can be parameterized in function of one variable; our main result proves that the partition regularity (PR) of such systems can be completely characterized by the existence of…
We prove some rigidity theorems for configurations of closed disks. First, fix two collections $\mathcal{C}$ and $\tilde{\mathcal{C}}$ of closed disks in the Riemann sphere $\hat{\mathbb{C}}$, sharing a contact graph which…
We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, we obtain a nearly sharp upper bound for the cardinality of Zaremba's set modulo…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
A new elementary proof for a theorem of D. Burns and S. Krantz on the rigidity of the analytic self maps of the unit disc was recently discovered by L. Baracco, D. Zaitsev, and G. Zampieri. We use their argument to generalize Burns-Krantz…
Let g be an integer greater than 1. A uniform version of the Parshin-Arakelov theorem on the finiteness of the set of non-isotrivial curves of genus g over a function field, with fixed degeneracy locus, is proved. This is applied to obtain…
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…
B\o gvad and H\"agg proved that for a rational function with simple poles, the zeros of successive derivatives accumulate on the Voronoi diagram of the pole set, and the normalized zero-counting measures converge to a canonical probability…
We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set, by looking only at finite or periodic products. It is known that when the matrices of the set have a common nonincreasing polyhedral…
We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…
We study the boundary behavior of functions in the Hardy spaces on the infinite dimensional polydisk. These spaces are intimately related to the Hardy spaces of Dirichlet series. We exhibit several Fatou and Marcinkiewicz-Zygmund type…