Results 81 to 90 of about 25,379 (179)
p$p$‐adic equidistribution and an application to S$S$‐units
Abstract We prove a Galois equidistribution result for torsion points in Gmn$\mathbb {G}_m^n$ in the p$p$‐adic setting for test functions of the form log|F|p$\log |F|_p$ where F$F$ is a nonzero polynomial with coefficients in the field of complex p$p$‐adic numbers.
Gerold Schefer
wiley +1 more source
Osculating geometry and higher‐order distance Loci
Abstract We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first‐order tangency. We focus on the data locus of points possessing at least one critical point of the distance function ...
Sandra Di Rocco +2 more
wiley +1 more source
Border Basis of an Ideal of Points and its Application in Experimental Design and Regression
Introduction Border bases are a generalization of Gröbner bases for zero-dimensional ideals which have attracted the interest of many researchers recently. More precisely, border bases provide a new method to find a structurally stable monomial basis for
Samira Poukhajouei +2 more
doaj
Regularity of Squarefree Monomial Ideals [PDF]
We survey a number of recent studies of the Castelnuovo-Mumford regularity of squarefree monomial ideals. Our focus is on bounds and exact values for the regularity in terms of combinatorial data from associated simplicial complexes and/or hypergraphs.
openaire +2 more sources
The motive of the Hilbert scheme of points in all dimensions
Abstract We prove a closed formula for the generating series Zd(t)$\mathsf {Z}_d(t)$ of the motives [Hilbd(An)0]$[\operatorname{Hilb}^d({\mathbb {A}}^n)_0]$ in K0(VarC)$K_0(\operatorname{Var}_{{\mathbb {C}}})$ of punctual Hilbert schemes, summing over n$n$, for fixed d>0$d>0$.
Michele Graffeo +3 more
wiley +1 more source
An algorithm to compute the Stanley depth of monomial ideals
In this article we describe an algorithm to compute the Stanley depth of I=J where I and J are monomial ideals. We describe also an implementation in CoCoA.
Giancarlo Rinaldo
doaj
Trees, parking functions, syzygies, and deformations of monomial ideals
For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ...
Postnikov, Alexander, Shapiro, Boris
core +5 more sources
A Gotzmann monomial ideal of the polynomial ring is a monomial ideal which is generated in one degree and which satisfies Gotzmann's persistence theorem. A subset $V$ is said to be a Gotzmann subset if the ideal generated by $V$ is a Gotzmann monomial ideal.
openaire +3 more sources
Summary: Reservoir computing has garnered significant attention for its efficiency in processing temporal signals, while the proposed next-generation reservoir computing (NG-RC) further enhances computational efficiency.
Zhuosheng Lin +5 more
doaj +1 more source
Increasing subsequences, matrix loci and Viennot shadows
Let ${\mathbf {x}}_{n \times n}$ be an $n \times n$ matrix of variables, and let ${\mathbb {F}}[{\mathbf {x}}_{n \times n}]$ be the polynomial ring in these variables over a field ${\mathbb {F}}$ .
Brendon Rhoades
doaj +1 more source

