English
Related papers

Related papers: A parametric version of the Hilbert Nullstellensat…

200 papers

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

Symbolic Computation · Computer Science 2026-05-12 Kosuke Sakata , Tsuyoshi Takagi

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

Data Structures and Algorithms · Computer Science 2020-11-25 Roman Galay , Daniil Kalistratov

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $M_{n,t}=(x^{e_1},\ldots, x^{e_n})$ be a monomial ideal of $R$, where $x^{e_i}=x_1^t\ldots x_{i-1}^tx_{i+1}^t\ldots x_n^t$. We study the unmixedness…

Commutative Algebra · Mathematics 2021-12-07 Amir Mafi , Dler Naderi

It is shown that the algebra \(L^\infty(\mu)\) of all bounded measurable functions with respect to a finite measure \(\mu\) is localizing on the Hilbert space \(L^2(\mu)\) if and only if the measure \(\mu\) has an atom. Next, it is shown…

Functional Analysis · Mathematics 2013-08-26 Miguel Lacruz , Luis Rodríguez-Piazza

We present a mathematical structure which unifies mathematical structures of general relativity and quantum mechanics. It consists of the noncommutative algebra of compactly supported, complex valued functions ${\mathcal A}$, with…

General Relativity and Quantum Cosmology · Physics 2008-10-15 Michael Heller , Leszek Pysiak , Wieslaw Sasin

With no criteria of the index type, it is proved the existence of a solution for the Riemann-Hilbert problem in the fairly general setting of arbitrary Jordan domains, measurable coefficients and measurable boundary data. The theorem is…

Complex Variables · Mathematics 2014-02-12 Vladimir Ryazanov

In this paper we prove a Nullstellensatz for supersymmetric polynomials. This gives a bijection between radical ideals and superalgebraic sets. These are algebraic sets which are invariant under the Weyl groupoid of Sergeev and Veselov,…

Rings and Algebras · Mathematics 2019-05-13 Ian M. Musson

Let $k$ be an algebraically closed field of characteristic zero and let $H$ be a noetherian cocommutative Hopf algebra over $k$. We show that if $H$ has polynomially bounded growth then $H$ satisfies the Dixmier-Moeglin equivalence. That…

Rings and Algebras · Mathematics 2025-09-23 Jason P. Bell , Wing Hong Leung

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

Complex Variables · Mathematics 2016-03-21 Jeffrey S. Geronimo , Plamen Iliev , Greg Knese

The Holstein-Primakoff representation for spin systems is used to derive expressions with solutions that are conjectured to be the zeros of Hermite polynomials $H_n(x)$ as $n \rightarrow \infty$. This establishes a correspondence between…

Mathematical Physics · Physics 2015-06-08 Lucas Kocia

We prove a localization theorem for the type A rational Cherednik algebra H_c=H_{1,c} over an algebraic closure of the finite field F_p. In the most interesting special case where the parameter c takes values in F_p, we construct an Azumaya…

Representation Theory · Mathematics 2021-11-25 Roman Bezrukavnikov , Michael Finkelberg , Victor Ginzburg

Let $R$ be a positively graded algebra over a field. We say that $R$ is Hilbert-cyclotomic if the numerator of its reduced Hilbert series has all of its roots on the unit circle. Such rings arise naturally in commutative algebra, numerical…

Commutative Algebra · Mathematics 2021-06-10 Alessio Borzì , Alessio D'Alì

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

Mathematical Physics · Physics 2016-02-17 Yuri A. Antipov

Quantum scientific computing is to solve engineering and science problems such as simulation and optimization on quantum computers. Solving ordinary and partial differential equations (PDEs) is essential in simulations. However, existing…

Numerical Analysis · Mathematics 2026-04-28 Eunsik Choi , Jungin E. Kim , Xueling Lu , Yan Wang

In this article, the two-parameter quantum Heisenberg enveloping algebra, which serves as a model for certain quantum generalized Heisenberg algebras, have been studied at roots of unity. In this context, the quantum Heisenberg enveloping…

Representation Theory · Mathematics 2024-02-07 Sanu Bera , Sugata Mandal , Soumendu Nandy

Let $\mathcal{M}$ be an atomless semifinite von Neumann algebra (or an atomic von Neumann algebra with all atoms having the same trace) acting on a (not necessarily separable) Hilbert space $H$ equipped with a semifinite faithful normal…

Operator Algebras · Mathematics 2023-01-09 Jinghao Huang , Fedor Sukochev

By a theorem of R. Stanley, a graded Cohen-Macaulay domain $A$ is Gorenstein if and only if its Hilbert series satisfies the functional equation \[ \operatorname{Hilb}_A(t^{-1})=(-1)^d t^{-a}\operatorname{Hilb}_A(t), \] where $d$ is the…

Combinatorics · Mathematics 2022-01-19 Hans-Christian Herbig , Daniel Herden , Christopher Seaton

We formulate the generalized Sarnak's M\"obius disjointness conjecture for an arbitrary number field $K$, and prove a quantitative disjointness result between polynomial nilsequences $(\Phi(g(n)\Gamma))_{n\in\mathbb{Z}^{D}}$ and aperiodic…

Number Theory · Mathematics 2023-01-16 Wenbo Sun

An FI- or an OI-module $\mathbf{M}$ over a corresponding noetherian polynomial algebra $\mathbf{P}$ may be thought of as a sequence of compatible modules $\mathbf{M}_n$ over a polynomial ring $\mathbf{P}_n$ whose number of variables depends…

Commutative Algebra · Mathematics 2020-06-24 Uwe Nagel

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Computational Complexity · Computer Science 2012-10-30 Nicolas de Rugy-Altherre