Related papers: Filtered rays over iterated absolute differences o…
We construct a collection of higher Chow cycles on certain surfaces which degenerate to an arrangement of planes in general position. When its degree is 4, this construction gives a new explicit proof of the Hodge-D-Conjecture for a certain…
We introduce merge-width, a family of graph parameters that unifies several structural graph measures, including treewidth, degeneracy, twin-width, clique-width, and generalized coloring numbers. Our parameters are based on new…
The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection $\Theta$ is convex in $\mathbb{R}^3$. The boundary $\partial\Theta$ of $\Theta$ may exhibit nontrivial geometry, in particular…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…
Fractals represent one of the fundamental manifestations of complexity, and fractal networks serve as tools for characterizing and investigating the fractal structures and properties of large-scale systems. Higher-order networks have…
The computation of the dimension of linear systems of plane curves through a bunch of given multiple points is one of the most classic issues in Algebraic Geometry. In general, it is still an open problem to understand when the points fail…
We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…
Fractional parts of the first $N$ natural numbers fill the unit interval with asymptotically uniform density. However, the gaps around rational points shrink at an asymptotically lower rate $N^{-1/2}$, and their widths scale with the Thomae…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences…
We investigate helicoidal (screw) surfaces generated not only by regular curves but also by curves with singular points. For curves with singular points, it is useful to use frontals in the Euclidean plane. The helicoidal surface of a…
In this paper, we study the distribution of the digital reverses of prime numbers, which we call the "reversed primes". We prove the infinitude of reversed primes in any arithmetic progression satisfying straightforward necessary conditions…
Higher order networks are able to characterize data as different as functional brain networks, protein interaction networks and social networks beyond the framework of pairwise interactions. Most notably higher order networks include…
The parity conjecture has a long and distinguished history. It gives a way of predicting the existence of points of infinite order on elliptic curves without having to construct them, and is responsible for a wide range of unexplained…
Let n,d be positive integers, with d even (say d=2e). Let X_(n,d) denote the locus of degree d hypersurfaces in P^n which consist of two e-fold hyperplanes. We bound the regularity of the ideal of this variety. Moreover, we show that this…
We study the {pair correlations between} prime numbers in an interval $M \leq p \leq M + L$ with $M \rightarrow \infty$, $L/M \rightarrow \beta > 0$. By analyzing the \emph{structure factor}, we prove, conditionally on the {Hardy-Littlewood…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we extend some of the notions that appear naturally in connection with these algorithms to the…
This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…