Related papers: On a result of Hayman concerning the maximum modul…
Maximizing a single submodular set function subject to a cardinality constraint is a well-studied and central topic in combinatorial optimization. However, finding a set that maximizes multiple functions at the same time is much less…
We give a sharp bound on the number of automorphisms of a stable curve of a given genus and describe all curves attaining this bound.
Bounding the number of rational points of height at most $H$ on irreducible algebraic plane curves of degree $d$ has been an intense topic of investigation since the work by Bombieri and Pila. In this paper we establish optimal dependence…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
A lot is known about the forward iterates of an analytic function which is bounded by 1 in modulus on the unit disk. The Denjoy-Wolff Theorem describes their convergence properties and several authors, from the 1880's to the 1980's, have…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…
In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the…
We study the closed convex hull of various collections of Hilbert functions. Working over a standard graded polynomial ring with modules that are generated in degree zero, we describe the supporting hyperplanes and extreme rays for the…
We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane.…
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…
In this note we discuss a class of hyperelliptic curves introduced by Abel in a 1826 paper. After some indications of the context in which he introduced them and a description of his main result we give some results on the moduli space of…
Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…
Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…
The planar Tur\'an number of a graph $H$, denoted $ex_{_\mathcal{P}}(n,H)$, is the maximum number of edges in a planar graph on $n$ vertices without containing $H$ as a subgraph. This notion was introduced by Dowden in 2016 and has…
We show that if the maximum modulus of a quasiregular mapping f grows sufficiently rapidly then there exists a non-empty escaping set I(f) consisting of points whose forward orbits under iteration tend to infinity. This set I(f) has an…
We develop the theory of coregular sequences and codepth for modules that need not be finitely generated or artinian over a Noetherian ring. We use this theory to give a new version of a theorem of Hellus characterizing set-theoretic…
Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…
Given the norms of powers $(\lVert x^n\rVert)_{n\geq 0}$ of a Banach algebra element $x$, the largest possible value of the minimum modulus on the spectrum of $x$ is determined. It is also shown that, given a Banach algebra element $x$ and…
The reach of a submanifold of $\mathbb{R}^N$ is defined as the largest radius of a tubular neighbourhood around the submanifold that avoids self-intersections. While essential in geometric and topological applications, computing the reach…