Related papers: The Minimal Resultant Locus

We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…

A rational map with good reduction in the field $\mathbb{Q}\_p$ of $p$-adic numbers defines a $1$-Lipschitz dynamical system on the projective line $\mathbb{P}^1(\mathbb{Q}\_p)$ over $\mathbb{Q}\_p$. The dynamical structure of such a system…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Given a nonconstant holomorphic map f: X -> Y between compact Riemann surfaces, one of the first objects we learn to construct is its ramification divisor R_f, which describes the locus at which f fails to be locally injective. The divisor…

The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…

We study the minimal resultant divisor of self-maps of the projective line over a number field or a function field and its relation to the conductor. The guiding focus is the exploration of a dynamical analog to Theorem 1.1, which bounds…

The subgradient method is one of the most fundamental algorithmic schemes for nonsmooth optimization. The existing complexity and convergence results for this method are mainly derived for Lipschitz continuous objective functions. In this…

Let K be a function field, let f be a rational function of degree d at least 2 defined over K, and suppose that f is not isotrivial. In this paper, we show that a point P in P^1(Kbar) has f-canonical height zero if and only if P is…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

In this paper, we study the problem of computing by relaxation hierarchies the infimum of a real polynomial function f on a closed basic semialgebraic set and the points where this infimum is reached, if they exist. We show that when the…

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

Let $K$ be a number field and let $\phi$ in $K(z)$ be a rational function of degree $d\geq 2$. Let $S$ be the places of bad reduction for $\phi$ (including the archimedan places). Let $Per(\phi,K)$, $PrePer(\phi, K)$, and $Tail(\phi,K)$ be…

We propose a descent subgradient algorithm for minimizing a real function, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Goldstein subdifferential is approximated through…

The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic system by Markov trees can achieve the minimum information loss with the topology of a maximum spanning tree. Our current paper generalizes the…

Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…

In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…

We describe a conjectural approach to obtaining canonical bases of the Hecke algebra at $q=1$ via continuous quadratic optimization. We focus on Specht modules $S^\lambda$ and proper cones inside $S^\lambda$ that are invariant under the…

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

Motivated by the notion of K-gentle partition of unity introduced in [12] and the notion of K-Lipschitz retract studied in [17], we study a weaker notion related to the Kantorovich-Rubinstein transport distance, that we call K-random…