Results 91 to 100 of about 14,720 (185)
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
Four Generated, Squarefree, Monomial Ideals [PDF]
to appear in "Bridging Algebra, Geometry, and Topology", Editors Denis Ibadula, Willem Veys, Springer Proceed. in Math.
Popescu, Adrian, Popescu, Dorin
openaire +2 more sources
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
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
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
Convergence properties of dynamic mode decomposition for analytic interval maps
Abstract Extended dynamic mode decomposition (EDMD) is a data‐driven algorithm for approximating spectral data of the Koopman operator associated to a dynamical system, combining a Galerkin method with N$N$ functions and a quadrature method with M$M$ quadrature nodes.
Elliz Akindji +3 more
wiley +1 more source
New methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$.
Mohammad Farrokhi D. G. +1 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
A tropical approach to rigidity: Counting realisations of frameworks
Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
Bounds for the regularity of monomial ideals
See directly the article.
Anne Frühbis-Krüger, Naoki Terai
doaj

