Matching works

7 works

math.GM — General Mathematics

An Algebraic Proof of Hilbert Nullstellensatz over Rationals

Contributed by liang zhang, Xiaohua(Michael) Xuan

We, with the aid of AI, prove a finite approximate form of the weak Nullstellensatz over the Gaussian rationals: Let f1,…,fmf_1,\ldots,f_m be polynomials in nn variables with rational complex coefficients. If there are no polynomials g1,…,gmg_1,\ldots,g_m in the same variables with rational complex coefficients such that 1=g1f1+⋯+gmfm1=g_1f_1+\cdots+g_mf_m. (A finite Gr\"obner basis computation decides whether such polynomials exist.), then, for any positive rational number ε\varepsilon, there exists a pont zz with nn rational complex coordinates such that \[ \sum_{j=1}^{m}\N(f_j(z))<\varepsilon^2, \] where N(a+ib)=a2+b2\N(a+ib)=a^2+b^2. The proof is constructive and relis only on finite rational arithmetics without using real numbers or infinite sets concepts, and extends authors' earlier one-vaiable result on Fundemental Theorem of Algerba to several-varaibles case.

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 16, 202629 pages
PDFView work

math.AG — Algebraic Geometry

The four-dimensional Hessian conjecture for potentials of degree at most five

Contributed by David Niedbala Giraudin

The Hessian conjecture HC_n asserts that if f in C[x_1,...,x_n] has det Hess(f) in C^×, then ∇f is a polynomial automorphism. It is known for n ≤ 3, false for n ≥ 5, and open for n = 4, where it implies the plane Jacobian conjecture. Ni proved HC_4 for potentials of degree at most four, and the author treated degree five when the top form depends on exactly three linear forms (hexagon:2611.00134). We prove HC_4 for every potential of degree at most five. The remaining top forms are a binary form or a fifth power of a linear form. Both cases are reduced, by weighted layers of the Hessian determinant and exact computer algebra over Q, to four elementary mechanisms: a Schur complement in one variable (which reduces to HC_3), a partial Legendre transform in two variables (which reduces to HC_2), a "dead direction" lemma (which reduces to HC_2 and the plane Jacobian conjecture in degrees at most (3,4), known by Moh), and explicit triangular inverses. Five self-contained verifiers are supplied as ancillary files. The paper has not been refereed.

Primarily AI-generated textHuman understanding: no partsGröbner basesHessian conjectureJacobian conjecturecomputer-assisted proofpolynomial automorphisms
Nov 06, 20267 pages
PDFView work

math.AC — Commutative Algebra

Zero-divisor methods for absolute concentration robustness

Contributed by Michael Mislan

We study the relation between absolute concentration robustness and zero divisors in steady-state coordinate rings. Explicit positive rational, two-sided bimolecular examples disprove both necessity and sufficiency of the proposed unrestricted criterion. A separate example shows why elimination order matters without contradicting lexicographic or product-order statements. We prove completeness of a block-compatible algebraic interface under explicit basis, leading-coverage, nonvacuity and zero-divisor hypotheses. The manuscript develops complementary criteria from regular positive geometry and quantitative algebraic certificates, with examples from loaded reactors, EnvZ and product-release networks. Selected counterexamples, the conditional completeness theorem and exact certificate identities are formalized in Lean 4. Geometric and nonlinear dynamical arguments supplied conventionally are identified separately.

Primarily AI-generated textHuman understanding: some partsLean formalizationabsolute concentration robustnesselimination ordersquantitative certificatessteady-state idealszero divisors
Oct 21, 202624 pages
PDFView work

math.PR — Probability

Poisson laws and arithmetic clusters for rare multiplicative patterns

Contributed by Brice Pouly

We determine when rare observations of completely multiplicative functions have a Poisson law and when arithmetic relations force clusters. For independent prime values on the circle with uniformly bounded L2L^2 densities, we approximate the field of hits of site-dependent targets of Haar mass O(N−1)O(N^{-1}) on deterministic masks in [2,CN][2,CN]. The target retains the true prime-site intensities and uses Haar at composite sites, even when the total prime contribution diverges. The exponent 22 is sharp in the uniform LqL^q scale for this target and class of masks. Below this threshold, even correct prime intensities can fail at site resolution while the total count remains asymptotically Poisson. A fixed finite exceptional prime environment, possibly atomic and internally dependent, instead produces a conditional cluster law together with an exact environment-determined configuration. With Haar outside that environment, its integer relation lattice determines the compound-Poisson limit of the corrected prefix count and characterizes simple Poisson convergence. Further applications treat rational observations on sparse moving supports, permanent bounded prime biases, and - using a binary arithmetic relation profile - long Borel patterns in a finite abelian group times a torus. Classical marked Chen-Stein comparison provides a common interface. A separate deterministic-sequence interface gives correlation identities, transfer criteria and a resolution obstruction, without proving cancellation for Liouville.

Primarily AI-generated textHuman understanding: no partsPoisson approximationarithmetic clusterscompound Poisson lawsprime-value densitiesrandom multiplicative functionsrelation latticesshrinking targets
Oct 18, 202663 pages
PDFView work

math.RA — Rings and Algebras

A Universal Noncommutative Splitting Algebra for Polynomials

Contributed by Darij Grinberg

Let RR be a commutative ring. We show that every homogeneous polynomial f∈R[x1,…,xm]f\in R[x_{1},\ldots,x_{m}] of degree nn splits into a product of nn homogeneous linear forms over a suitable noncommutative ring extension SS of RR (that is, over a noncommutative RR-algebra SS whose structure morphism R→SR\rightarrow S is injective). The algebra SS is universal for such factorizations and is free as an RR-module. The proof uses Bergman's Diamond Lemma: we define SS by generators and relations, and the relations form a terminating reduction system that has no ambiguities and thus is confluent. An analogous result is also shown for inhomogeneous polynomials (with inhomogeneous factors). This easily follows from the homogeneous case by homogenizing and then setting the homogenizing variable equal to 11.

A mix of human-written and AI-generated textHuman understanding: all partsBergman's diamond lemmaGröbner basescombinatorial algebranoncommutative polynomials
Sep 29, 202610 pages
PDFView work

math.AC — Commutative Algebra

Polynomials over Symmetric Polynomials

Contributed by Darij Grinberg

Let k\mathbf{k} be a commutative ring, and let the symmetric group Sn\mathfrak{S}_{n} act on $P=\mathbf{k}\left[ x_{1} ,x_{2},\ldots,x_{n} \right] $ by permuting the variables. We prove four results that are known (at least in the case when k\mathbf{k} is a field) but not easily found in the literature. First, the coinvariant algebra (the quotient of PP by the ideal generated by the symmetric polynomials with constant term 00) is a free k\mathbf{k}-module of rank n!n!, with the residue classes of the Artin monomials as a basis. Second, PP is a free module of rank n!n! over the ring PSnP^{\mathfrak{S}_{n}} of symmetric polynomials, again with the Artin monomials as a basis. Third, if n!n! is invertible in k\mathbf{k}, the coinvariant algebra is the regular $\mathbf{k}\left[ \mathfrak{S}_{n} \right] $-module. Fourth, under the same hypothesis, PP is a free left PSn[Sn]P^{\mathfrak{S}_{n}}\left[ \mathfrak{S}_{n} \right] -module of rank 11. The first result follows from an elementary normal-form lemma for monic polynomials with pairwise relatively prime leading monomials. The second is proved by lifting the Artin basis. For the third, we use orbit harmonics with a strongly discrete point orbit, and the fourth follows by equivariantly lifting a regular basis of the coinvariant algebra.

A mix of human-written and AI-generated textHuman understanding: all partsArtin basisGröbner basescoinvariant algebraorbit harmonicssymmetric polynomials
Sep 28, 202629 pages
PDFView work

math.AC — Commutative Algebra

Splitting a Polynomial into Linear Factors after an Injective Ring Extension

Contributed by Darij Grinberg

We show that each univariate polynomial P=p0+p1X+⋯+pmXm∈R[X]P = p_0 + p_1 X + \cdots + p_m X^m \in R[X] over a commutative ring RR can be factored into linear factors over a suitable commutative ring extension SS of RR. The proof proceeds by universal construction: SS is defined as the tensor product R⊗CmBmR \otimes_{C_m} B_m, where BmB_m is the polynomial ring $\ZZ[a_1, b_1, a_2, b_2, \ldots, a_m, b_m]$, and where CmC_m is its subring generated by its ``homogenized elementary symmetric polynomials'' Er=∑I⊆[m];∣I∣=r∏i∈Iai∏i∉IbiE_r=\sum_{\substack{I\subseteq [m];\\ |I|=r}} \prod_{i\in I}a_i\prod_{i\notin I}b_i for all 0≤r≤m0 \leq r \leq m. The injectivity of the structure homomorphism R→SR \to S is deduced from a combinatorial study of the diagonal subring of BmB_m. In the process, a homogeneous variant of the Garsia--Stanton basis is constructed, and some classical properties of symmetric polynomials are recovered.

A mix of human-written and AI-generated textHuman understanding: all parts
Sep 28, 202629 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations