Related papers: Nonstandard methods for bounds in differential pol…

In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective. Then we find height bounds in the polynomial ring over algebraic numbers to test…

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

We give the first known bound for orders of differentiations in differential Nullstellensatz for both partial and ordinary algebraic differential equations. This problem was previously addressed by A. Seidenberg but no complete solution was…

Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…

Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…

The theory of border bases for zero-dimensional ideals has attracted several researchers in symbolic computation due to their numerical stability and mathematical elegance. As shown in (Francis & Dukkipati, J. Symb. Comp., 2014), one can…

In 2016 Ananyan and Hochster proved Stillman's conjecture by showing the existence of a uniform upper bound on the length of an $R_\eta$-sequence containing fixed $n$ forms of degree at most $d$ in polynomial rings over a field. This result…

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

This is a Research and Instructional Development Project from the U. S. Naval Academy. In this monograph, the basic methods of nonstandard analysis for n-dimensional Euclidean spaces are presented. Specific rules are deveoped and these…

We estimate the Castelnuovo-Mumford regularity of ideals in a polynomial ring over a field by studying the regularity of certain modules generated in degree zero and with linear relations. In dimension one, this process gives a new type of…

We study the boundary behavior of solutions to the Dirichlet problems for integro-differential operators with order of differentiability $s \in (0, 1)$ and summability $p>1$. We establish a nonlocal counterpart of the Wiener criterion,…

We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds are established in settings where one of the parameters is…

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

The methods of nonstandard analysis are applied to algebra and number theory. We study nonstandard Dedekind rings, for example an ultraproduct of the ring of integers of a number field. Such rings possess a rich structure and have…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…