相关论文: Analytic residue theory in the non-complete inters…
Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether…
Let R be a complete discrete valuation ring with algebraically closed residue field k and fraction field K. Let X_K be a projective smooth and geometrically connected scheme over K. N\'eron defined a canonical pairing on X_K between…
In recent work of T. Cassidy and the author, a notion of complete intersection was defined for (non-commutative) regular skew polynomial rings, defining it using both algebraic and geometric tools, where the commutative definition is a…
We consider traffic flows described by conservation laws. We study a 2:1 junction (with two incoming roads and one outgoing road) or a 1:2 junction (with one incoming road and two outgoing roads). At the mesoscopic level, the priority law…
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…
We introduce a recursive decomposition algorithm for the Betti diagram of a complete intersection using the diagram of a complete intersection defined by a subset of the original generators. This alternative algorithm is the main tool that…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
The following ``Key Lemma'' plays an important role in Parusinski's work on the existence of Lipschitz stratifications in the class of semianalytic sets: For any positive integer n, there is a finite set of homogeneous symmetric polynomials…
This paper introduces the foundations of the polynomial algebra and basic structures for algebraic geometry over the extended tropical semiring. Our development, which includes the tropical version for the fundamental theorem of algebra,…
We investigate families of subsets of $\omega$ with almost disjoint refinements in the classical case as well as with respect to given ideals on $\omega$. More precisely, we study the following topics and questions: 1) Examples of…
A class of scalar models with non-polynomial interaction, which naturally admits an analytical resummation of the series of tadpole diagrams is studied in perturbation theory. In particular, we focus on a model containing only one…
Let I = (F_1,...,F_r) be a homogeneous ideal of R = k[x_0,...,x_n] generated by a regular sequence of type (d_1,...,d_r). We give an elementary proof for an explicit description of the graded Betti numbers of I^s for any s \geq 1. These…
We prove a non-commutative version of the Hilbert's 17th problem, giving a characterization of the class of non-commutative polynomials in n-undeterminates that have positive trace when evaluated in n-selfadjoint elements in arbitrary II1…
We present a convergence theory for Optimized Schwarz Methods that rely on a non-local exchange operator and covers the case of coercive possibly non-self-adjoint impedance operators. This analysis also naturally deals with the presence of…
We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…
The parqueting-reflection principle is shown to also work for constructing harmonic Green functions and harmonic Neumann functions for a class of domains, which are bounded by two arcs in $\mathbb{C}$ with a special intersecting angle…
We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…
Paths $P_1,\ldots,P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to decide if…
The main result of this note is a tracial Nullstellensatz for free noncommutative polynomials evaluated at tuples of matrices of all sizes: Suppose f_1,...,f_r,f are free polynomials, and tr(f) vanishes whenever all tr(f_j) vanish. Then…
Using neural networks to solve variational problems, and other scientific machine learning tasks, has been limited by a lack of consistency and an inability to exactly integrate expressions involving neural network architectures. We address…