Related papers: Analytic residue theory in the non-complete inters…
We give a general method for producing various effective Null and Positivstellens\"atze, and getting new Positivstellens\"atze in algebraically closed valued fields and ordered groups. These various effective Nullstellens\"atze produce…
Let G denote a connected, quasi-split reductive group over a field F that is complete with respect to a discrete valuation and that has a perfect residue field. Under mild hypotheses, we produce a subset of the Lie algebra g(F) that picks…
This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
We propose a new class of single-field scalar quantum field theories with non-polynomial interactions leading to a two-point Green's function that can be naturally continued beyond the naive cutoff scale. This provides a new prospect for…
A Nullstellensatz is a theorem providing information on polynomials that vanish on a certain set: David Hilbert's Nullstellensatz (1893) is a cornerstone of algebraic geometry, and Noga Alon's Combinatorial Nullstellensatz (1999) is a…
Let F denote either the real or complex field. An ideal I in the free *-algebra F<x,x*> in g freely noncommuting variables and their formal adjoints is a *-ideal if I = I*. When a real *-ideal has finite codimension, it satisfies a strong…
In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…
We introduce the p-adic analogue of Arakelov intersection theory on arithmetic surfaces. The intersection pairing in an extension of the p-adic height pairing for divisors of degree 0 in the form described by Coleman and Gross. It also uses…
The space of subvarieties of P^n with a fixed Hilbert polynomial is not complete. Grothendieck defined a completion by relaxing "variety" to "scheme", giving the complete_Hilbert scheme_ of subschemes of P^n with fixed Hilbert polynomial.…
We study the computational complexity of the membership problem for arithmetic circuits over natural numbers with division. We consider different subsets of the operations {intersection,union,complement,+,x,/}, where / is the element-wise…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
von Neumann algebras have been playing an increasingly important role in the context of gauge theories and gravity. The crossed product presents a natural method for implementing constraints through the commutation theorem, rendering it a…
We apply the tropical intersection theory developed by L. Allermann and J. Rau to compute intersection products of tropical Psi-classes on the moduli space of rational tropical curves. We show that in the case of zero-dimensional (stable)…
We show here how residue calculus (residue currents, Grothendieck residues, duality theorem) can be used to obtain an algebraic characterization of the Abel-transform of a meromorphic form on germs of analytic sets. We prove by this way a…
Let $A$ be a graded complete intersection over a field and $B$ the monomial complete intersection with the generators of the same degrees as $A$. The EGH conjecture says that if $I$ is a graded ideal in $A$, then there should be an ideal…
Normalizing flows are a powerful tool for generative modelling, density estimation and posterior reconstruction in Bayesian inverse problems. In this paper, we introduce proximal residual flows, a new architecture of normalizing flows.…
The idea of a finite collection of closed sets having "strongly regular intersection" at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically,…
The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but…