English
Related papers

Related papers: Explicit Noether Normalization for Simultaneous Co…

200 papers

We study rings which have Noetherian cohomology under the action of a ring of cohomology operators. The main result is a criterion for a complex of modules over such a ring to have finite injective dimension. This criterion generalizes, by…

Commutative Algebra · Mathematics 2012-05-14 Jesse Burke

Duality identities in random matrix theory for products and powers of characteristic polynomials, and for moments, are reviewed. The structure of a typical duality identity for the average of a positive integer power $k$ of the…

Mathematical Physics · Physics 2025-01-14 Peter J. Forrester

We define a new method for taking advantage of net reductions in combination with a SMT-based model checker. Our approach consists in transforming a reachability problem about some Petri net, into the verification of an updated reachability…

Logic in Computer Science · Computer Science 2023-06-22 Nicolas Amat , Bernard Berthomieu , Silvano Dal Zilio

In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…

Statistics Theory · Mathematics 2025-05-28 Rushil Mallarapu , Mark Sellke

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…

Computational Complexity · Computer Science 2010-07-19 Zhixiang Chen , Bin Fu , Yang Liu , Robert Schweller

In this paper, we mainly establish the existence of at least three non-trivial solutions for a class of nonhomogeneous quasilinear elliptic systems with Dirichlet boundary value or Neumann boundary value in a bounded domain…

Analysis of PDEs · Mathematics 2024-06-28 Xiaoli Yu , Xingyong Zhang

We investigate the problem of synthesizing T-depth optimal quantum circuits over the Clifford+T gate set. First we construct a special subset of T-depth 1 unitaries, such that it is possible to express the T-depth-optimal decomposition of…

Quantum Physics · Physics 2022-09-14 Vlad Gheorghiu , Michele Mosca , Priyanka Mukhopadhyay

A polynomial knot in $\mathbb{R}^n$ is a smooth embedding of $\mathbb{R}$ in $\mathbb{R}^n$ such that the component functions are real polynomials. In the earlier paper with Mishra, we have studied the space $\mathcal{P}$ of polynomial…

General Topology · Mathematics 2021-01-05 Hitesh Raundal

We study coherent systems of type $(n,d,n+1)$ on a Petri curve $X$ of genus $g\ge2$. We describe the geometry of the moduli space of such coherent systems for large values of the parameter $\alpha$. We determine the top critical value of…

Algebraic Geometry · Mathematics 2007-12-14 U. N. Bhosle , L. Brambila-Paz , P. E. Newstead

Substantial changes in many parts of the paper. In particular, significantly expanded treatment of monomial ideals and of Castelnuovo-Mumford regularity. Also relation between delta-regularity and Noether normalisation now treated.

Commutative Algebra · Mathematics 2009-12-05 Werner M. Seiler

We prove a non-linear Edelstein-Kelly theorem for polynomials of constant degree, fully settling a stronger form of Conjecture 30 in Gupta (2014), and generalizing the main result of Peleg and Shpilka (STOC 2021) from quadratic polynomials…

Computational Complexity · Computer Science 2025-04-28 Abhibhav Garg , Rafael Oliveira , Akash Kumar Sengupta

We study algorithms for approximating pairwise similarity matrices that arise in natural language processing. Generally, computing a similarity matrix for $n$ data points requires $\Omega(n^2)$ similarity computations. This quadratic…

Machine Learning · Computer Science 2022-04-28 Archan Ray , Nicholas Monath , Andrew McCallum , Cameron Musco

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

Computational Complexity · Computer Science 2022-10-28 Robert Andrews , Michael A. Forbes

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

Combinatorics · Mathematics 2021-08-04 Qi Yan , Xian'an Jin

The classical Noether Normalization Lemma states that if $S$ is a finitely generated algebra over a field $k$, then there exist elements $x_1,\dots,x_n$ which are algebraically independent over $k$ such that $S$ is a finite module over…

Rings and Algebras · Mathematics 2026-04-17 Dinh Van Hoang , Phan Thanh Toan

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at…

Numerical Analysis · Mathematics 2012-12-20 Nan Li , Lihong Zhi

The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and for estimating combinatorial diameters. Determining the…

Optimization and Control · Mathematics 2025-01-23 Christian Nöbel , Raphael Steiner

We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the model $M$ and a sampling oracle for the distribution…

Data Structures and Algorithms · Computer Science 2019-06-21 Ivona Bezakova , Antonio Blanca , Zongchen Chen , Daniel Štefankovič , Eric Vigoda

We prove the (generalized) principal pivot transform is matrix monotone, in the sense of the L\"owner ordering, under minimal hypotheses. This improves on the recent results of J. E. Pascoe and R. Tully-Doyle, Monotonicity of the principal…

Functional Analysis · Mathematics 2023-02-13 Kenneth Beard , Aaron Welters

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