English
Related papers

Related papers: Nonstandard methods for bounds in differential pol…

200 papers

In this paper, we prove that if $P$ is a homogeneous prime ideal inside a standard graded polynomial ring $S$ with $\dim(S/P)=d$, and for $s \leq d$, adjoining $s$ general linear forms to the prime ideal changes the $(d-s)$-th Hilbert…

Commutative Algebra · Mathematics 2025-01-15 Cheng Meng

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Symbolic Computation · Computer Science 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

Numerical Analysis · Mathematics 2015-06-16 Victor Y. Pan , Liang Zhao

The research of the Dirichlet problem with arbitrary measurable datafor harmonic functions is due to the famous dissertation of Luzin. The present paper is devoted to various theorems on the existence of nonclassical solutions of the…

Complex Variables · Mathematics 2020-01-06 Vladimir Ryazanov

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

We study inverse boundary problems for semilinear Schr\"odinger equations on smooth compact Riemannian manifolds of dimensions $\ge 2$ with smooth boundary, at a large fixed frequency. We show that certain classes of cubic nonlinearities…

Analysis of PDEs · Mathematics 2024-02-21 Katya Krupchyk , Shiqi Ma , Suman Kumar Sahoo , Mikko Salo , Simon St-Amant

Let $K$ be a number field and $f_1,\ldots,f_s\in K[x_1,\ldots,x_n]$ forms of odd degrees. In 1957, Birch proved that if $n$ is sufficiently large then the forms always have a nontrivial zero in $K^n$. Apart from some small degrees, the…

Number Theory · Mathematics 2025-12-02 Amichai Lampert , Andrew Snowden , Tamar Ziegler

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Computational Complexity · Computer Science 2008-04-15 Gábor Ivanyos , Marek Karpinski , Nitin Saxena

Optical resonators provide a powerful tool for testing aspects of Lorentz invariance. Here, we present a reanalysis of an experiment where a path asymmetry was created in an optical ring resonator by introducing a dielectric prism in one…

High Energy Physics - Phenomenology · Physics 2015-08-12 Stephen R. Parker , Matthew Mewes , Fred N. Baynes , Michael E. Tobar

Classifications of irreducible components of the set of polynomial differential equations with a fixed degree and with at least one center singularity lead to some other new problems on Picard-Lefschetz theory and Brieskorn modules of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Hossein Movasati

Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our…

Symbolic Computation · Computer Science 2015-03-19 Asieh Pourhaghani

Properties of partial integrals such as real and complex-valued polynomial, multiple polynomial, exponential, and conditional for ordinary differential systems are studied. The possibilities of constructing first integrals and last…

Classical Analysis and ODEs · Mathematics 2018-09-20 V. N. Gorbuzov

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Rings and Algebras · Mathematics 2024-03-19 Alina G. Goutor , Sergey V. Tikhonov

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

We show that a wide range of overdetermined boundary problems for semilinear equations with position-dependent nonlinearities admits nontrivial solutions. The result holds true both on the Euclidean space and on compact Riemannian…

Analysis of PDEs · Mathematics 2017-11-27 Miguel Dominguez-Vazquez , Alberto Enciso , Daniel Peralta-Salas

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

We present some upper and lower bounds for the numerical radius of a bounded linear operator defined on complex Hilbert space, which improves on the existing upper and lower bounds. We also present an upper bound for the spectral radius of…

Functional Analysis · Mathematics 2024-08-13 Pintu Bhunia , Santanu Bag , Kallol Paul

The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied. However, nonlinear partial differential equations (PDEs) pose substantial challenges from an…

Numerical Analysis · Mathematics 2021-08-26 Junyang Wang , Jon Cockayne , Oksana Chkrebtii , T. J. Sullivan , Chris. J. Oates

In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…

Commutative Algebra · Mathematics 2013-02-27 Markus Kriegl

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

Combinatorics · Mathematics 2015-03-31 Hong Wang , Ben Yang , Ruixiang Zhang