English
Related papers

Related papers: Non-Commutative Gebauer-Moeller Criteria

200 papers

We show polylogarithmic mixing time bounds for the alternating-scan sampler for positively weighted restricted Boltzmann machines. This is done via analysing the same chain and the Glauber dynamics for ferromagnetic two-spin systems, where…

Data Structures and Algorithms · Computer Science 2026-05-26 Weiming Feng , Heng Guo , Minji Yang

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Number Theory · Mathematics 2016-01-19 Eric Y. Chen , J. T. Ferrara , Liam Mazurowski

Let $R=K[x_1,\ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I$ be a polymatroidal ideal of $R$. In this paper, we provide a comprehensive classification of all unmixed polymatroidal ideals. This work…

Commutative Algebra · Mathematics 2025-02-20 Mozghan Koolani , Amir Mafi , Hero Saremi

The technique developed in Hochschild's works "Lie algebra kernels and cohomology " and "Cohomology classes of finite dimensional kernels for Lie algebras " [2],[3] can be applied to the special case of transitive Lie algebroids. Our task…

Algebraic Topology · Mathematics 2019-04-01 Vagif Gasimov

Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…

Rings and Algebras · Mathematics 2024-06-18 Matthias Schötz

The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…

Data Structures and Algorithms · Computer Science 2013-12-03 Krasimir Yordzhev

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

Combinatorics · Mathematics 2011-10-19 Nicolas Borie , Nicolas M. Thiéry

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

For a polynomial with palindromic coefficients, unimodality is equivalent to having a nonnegative $g$-vector. A sufficient condition for unimodality is having a nonnegative $\gamma$-vector, though one can have negative entries in the…

Combinatorics · Mathematics 2016-01-20 Charles Brittenham , Andrew Carroll , T. Kyle Petersen , Connor Thomas

In this paper, we study feature cross search as a fundamental primitive in feature engineering. The importance of feature cross search especially for the linear model has been known for a while, with well-known textbook examples. In this…

Machine Learning · Computer Science 2021-07-06 Lin Chen , Hossein Esfandiari , Gang Fu , Vahab S. Mirrokni , Qian Yu

Boolean, free and monotone cumulants as well as relations among them, have proven to be important in the study of non-commutative probability theory. Quite notably, Boolean cumulants were successfully used to study free infinite…

Combinatorics · Mathematics 2021-11-05 Adrian Celestino , Kurusch Ebrahimi-Fard , Daniel Perales

This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…

Let $K\ < x_i\ >$ be the free associative algebra generated by a finite or countable number of variables $x_i$. The notion of "letterplace correspondence" introduced in [1,2] for the graded (two-sided) ideals of $K\ < x_i\ >$ is extended in…

Rings and Algebras · Mathematics 2014-12-10 Roberto La Scala

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

Algebraic Geometry · Mathematics 2026-02-03 Carlos Agrinsoni , Heeralal Janwa , Moises Delgado

In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…

Symbolic Computation · Computer Science 2017-01-24 Yu-Ao Chen , Xiao-Shan Gao

In this paper, the Composition-Diamond lemma for commutative algebras with multiple operators is established. As applications, the Gr\"obner-Shirshov bases and linear bases of free commutative Rota-Baxter algebra, free commutative…

Rings and Algebras · Mathematics 2013-01-23 Jianjun Qiu

Non-commutative Hilbert schemes, introduced by M. V. Nori, parametrize left ideals of finite codimension in free algebras. More generally, parameter spaces of finite codimensional submodules of free modules over free algebras are…

Algebraic Geometry · Mathematics 2007-05-23 Markus Reineke

A natural candidate for a generating set of the (necessarily prime) defining ideal of an $n$-dimensional monomial curve, when the ideal is an almost complete intersection, is a full set of $n$ critical binomials. In a somewhat modified and…

Commutative Algebra · Mathematics 2012-07-02 Liam O'Carroll , Francesc Planas-Vilanova

Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions. We propose a class of strongly convergent algorithms for…

Optimization and Control · Mathematics 2014-10-08 Abdullah Alotaibi , Patrick L. Combettes , Naseer Shahzad