English
Related papers

Related papers: H\"older-Type Global Error Bounds for Non-degenera…

200 papers

We consider a \emph{family} $(P_\omega)_{\omega \in \Omega}$ of elliptic second order differential operators on a domain $U_0 \subset \mathbb{R}^m$ whose coefficients depend on the space variable $x \in U_0$ and on $\omega \in \Omega,$ a…

Analysis of PDEs · Mathematics 2023-08-16 Simon Labrunie , Hassan Mohsen , Victor Nistor

Let $\A$ be an algebra and let $f(x_1,...,x_d)$ be a multilinear polynomial in noncommuting indeterminates $x_i$. We consider the problem of describing linear maps $\phi:\A\to \A$ that preserve zeros of $f$. Under certain technical…

Rings and Algebras · Mathematics 2012-04-25 J. Alaminos , M. Brešar , Š. Špenko , A. R. Villena

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…

Optimization and Control · Mathematics 2026-02-12 Ching-pei Lee , Stephen J. Wright

We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

Complex Variables · Mathematics 2007-12-03 Han Peters

In this paper, we consider the following $(A, B)$-polynomial $f$ over finite field: $$f(x_0,x_1,\cdots,x_n)=x_0^Ah(x_1,\cdots,x_n)+g(x_1,\cdots,x_n)+P_B(1/x_0),$$ where $h$ is a Deligne polynomial of degree $d$, $g$ is an arbitrary…

Number Theory · Mathematics 2021-08-31 Liping Yang , Hao Zhang

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

Combinatorics · Mathematics 2025-02-21 Yaobin Chen , Xizhi Liu , Jiaxi Nie , Ji Zeng

A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case. As an extension of previous work, two joint error-and-erasure decoding approaches…

Information Theory · Computer Science 2012-02-27 Jiun-Hung Yu

Consider a polynomial $f$ with a convenient Newton polytope $P$ and generic complex coefficients. By the global version of the Kouchnirenko formula, the hypersurface $\{f = 0\} \subset \mathbb{C}^n$ has the homotopy type of a bouquet of…

Combinatorics · Mathematics 2025-10-20 Fedor Selyanin

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

Algebraic Geometry · Mathematics 2013-09-03 Kaitlyn Phillipson , J. Maurice Rojas

Let $L$ be a finite extension of $\mathbb{F}_q(t)$. We calculate the proportion of polynomials of degree $d$ in $\mathbb{F}_q[t]$ that are everywhere locally norms from $L/\mathbb{F}_q(t)$ which fail to be global norms from…

Number Theory · Mathematics 2024-01-29 Adelina Mânzăţeanu , Rachel Newton , Ekin Ozman , Nicole Sutherland , Rabia Gülşah Uysal

We give a criterion for certain generic nondegenerate surfaces in a fake weighted projective $3$-space to have Picard number $>1$. These algebraic surfaces are of general type. We do this by considering degenerations (along an edge),…

Algebraic Geometry · Mathematics 2026-04-29 Julius Giesler

Consider an absolutely irreducible polynomial $F(Y,X_1,\ldots,X_n) \in \mathbb{Z}[Y,X_1,\ldots,X_n]$ that is monic in $Y$ and is a polynomial in $Y^m$ for an integer $m \geq 1$. Let $N(F,B)$ count the number of $\mathbf{x} \in [-B,B]^n \cap…

Number Theory · Mathematics 2025-05-19 Dante Bonolis , Lillian B. Pierce , Katharine Woo

Let $K$ be a number field, $f\in K[x]$ a quadratic polynomial, and $n\in\{1,2,3\}$. We show that if $f$ has a point of period $n$ in every non-archimedean completion of $K$, then $f$ has a point of period $n$ in $K$. For $n\in\{4,5\}$ we…

Number Theory · Mathematics 2016-03-03 David Krumm

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

Number Theory · Mathematics 2015-01-14 Artūras Dubickas , Min Sha

We show that on a $\sigma$-finite measure preserving system $X = (X,\nu, T)$, the non-conventional ergodic averages $$ \mathbb{E}_{n \in [N]} \Lambda(n) f(T^n x) g(T^{P(n)} x)$$ converge pointwise almost everywhere for $f \in L^{p_1}(X)$,…

Dynamical Systems · Mathematics 2026-01-26 Ben Krause , Hamed Mousavi , Terence Tao , Joni Teräväinen

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

Optimization and Control · Mathematics 2012-11-15 Mehdi Ghasemi , Murray Marshall

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Number Theory · Mathematics 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib

We study the generalization performance of unregularized gradient methods for separable linear classification. While previous work mostly deal with the binary case, we focus on the multiclass setting with $k$ classes and establish novel…

Machine Learning · Computer Science 2025-05-29 Matan Schliserman , Tomer Koren

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov