English
Related papers

Related papers: On a result of Hayman concerning the maximum modul…

200 papers

It was once conjectured that if $A$ is a uniform algebra on its maximal ideal space $X$, and if each point of $X$ is a peak point for $A$, then $A = C(X)$. This peak-point conjecture was disproved by Brian Cole in 1968. Here we establish a…

Complex Variables · Mathematics 2017-07-05 John T. Anderson , Alexander J. Izzo

The Wiener polynomial of a connected graph $G$ is defined as $W(G;x)=\sum x^{d(u,v)}$, where $d(u,v)$ denotes the distance between $u$ and $v$, and the sum is taken over all unordered pairs of distinct vertices of $G$. We examine the nature…

Combinatorics · Mathematics 2018-01-15 Jason I. Brown , Ortrud Oellermann , Lucas Mol

Given a max-plus linear system and a semimodule, the problem of computing the maximal controlled invariant subsemimodule is still open to this day. In this paper, we consider this problem for the specific class of fully actuated systems and…

Optimization and Control · Mathematics 2026-02-10 Davide Zorzenon , Jörg Raisch

We give two proofs that appropriately defined congruence subgroups of the mapping class group of a surface with punctures/boundary have enormous amounts of rational cohomology in their virtual cohomological dimension. In particular we give…

Geometric Topology · Mathematics 2022-02-21 Tara Brendle , Nathan Broaddus , Andrew Putman

We determine all modular curves $X_0(N)$ with density degree $5$, i.e. all curves $X_0(N)$ with infinitely many points of degree $5$ and only finitely many points of degree $d\leq4$. As a consequence, the problem of determining all curves…

Number Theory · Mathematics 2026-02-20 Maarten Derickx , Wontae Hwang , Daeyeol Jeon , Petar Orlić

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…

Numerical Analysis · Mathematics 2021-02-26 Aleš Vavpetič , Emil Žagar

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…

Discrete Mathematics · Computer Science 2020-07-01 Rishabh Iyer , Jeff Bilmes

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of…

Combinatorics · Mathematics 2023-01-19 Stijn Cambie , Jun Gao , Hong Liu

We study a mixed-integer set $S:=\{(x,t) \in \{0,1\}^n \times \mathbb{R}: f(x) \ge t\}$ arising in the submodular maximization problem, where $f$ is a submodular function defined over $\{0,1\}^n$. We use intersection cuts to tighten a…

Optimization and Control · Mathematics 2023-02-28 Liding Xu , Leo Liberti

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

Data Structures and Algorithms · Computer Science 2023-06-22 Katrin Casel , Philipp Fischbeck , Tobias Friedrich , Andreas Göbel , J. A. Gregor Lagodzinski

Let $\gamma$ be a filling curve on a topological surface $\Sigma$ of genus $g \geq 2$. The inf invariant of $\gamma$, denoted $m_{\gamma}$, is the infimum of the length function on the space of marked hyperbolic structures on $\Sigma$. This…

Geometric Topology · Mathematics 2025-08-13 Ara Basmajian , Sayantika Mondal

We relate the analytic spread of a module expressed as the direct sum of two submodules with the analytic spread of its components. We also study a class of submodules whose integral closure can be obtained by means of a simple computer…

Commutative Algebra · Mathematics 2020-11-04 Carles Bivià-Ausina , Jonathan Montaño

Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for…

Systems and Control · Electrical Eng. & Systems 2023-03-20 Hamid R. Ossareh , Ilya Kolmanovsky

A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…

Differential Geometry · Mathematics 2007-05-23 B. Langerock

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

Combinatorics · Mathematics 2026-04-14 Benjamin Nill

In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…

Number Theory · Mathematics 2024-11-20 Diego Alves , Jean Lelis , Diego Marques , Pavel Trojovský

It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…

Complex Variables · Mathematics 2007-10-03 Markiyan Hirnyk

We prove that integral points can be effectively determined on all but finitely many modular curves, and on all but one modular curve of prime power level.

Number Theory · Mathematics 2014-02-26 Yuri Bilu , Marco Illengo

We introduce several new methods to obtain upper bounds on the number of solutions of the congruences $f(x) \equiv y \pmod p$ and $f(x) \equiv y^2 \pmod p,$ with a prime $p$ and a polynomial $f$, where $(x,y)$ belongs to an arbitrary square…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan
‹ Prev 1 4 5 6 7 8 10 Next ›