中文
相关论文

相关论文: Short Rational Functions for Toric Algebra and App…

200 篇论文

We study the Poincar\'e series of the mixed and pure trace rings of generic matrices. These series are known to be rational functions. We obtain an explicit formula in lowest terms in the case of $2\times2$ matrices; a denominator, which we…

环与代数 · 数学 2022-09-07 Allan Berele

For an arbitrary field K, let I be an ideal in the ring K[[x,y]] expressible as a polynomial in either the pair of ideals (x, y^4) and (x,y) or the pair (x,y^3) and (x^2, y). Let G be the group of automorphisms of K[[x,y]] sending the ideal…

代数几何 · 数学 2007-05-23 Heather Russell

In this note, basing on a certain functional equation of the dilogarithm function, we establish nontrivial lower bounds for the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers involving harmonic…

数论 · 数学 2022-12-08 Bakir Farhi

Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…

符号计算 · 计算机科学 2026-03-06 Alexander Demin , Gleb Pogudin

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

组合数学 · 数学 2007-07-18 Nathan Grigg , Nathan Manwaring

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

组合数学 · 数学 2010-06-08 J. A. De Loera , C. Hillar , P. N. Malkin , M. Omar

The symmetric group $\mathfrak{S}_n$ acts on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The invariant ideal $I_n$ is the ideal generated by all $\mathfrak{S}_n$-invariant…

组合数学 · 数学 2019-04-04 James Haglund , Brendon Rhoades , Mark Shimozono

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

交换代数 · 数学 2007-05-23 Edward Mosteig

We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A…

最优化与控制 · 数学 2017-01-03 Raymond Hemmecke , Matthias Köppe , Robert Weismantel

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

交换代数 · 数学 2020-11-20 Yairon Cid-Ruiz , Roser Homs , Bernd Sturmfels

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

符号计算 · 计算机科学 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…

环与代数 · 数学 2011-10-26 Viktor Levandovskyy , Kristina Schindelar

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

代数拓扑 · 数学 2012-06-13 Peter Bubenik , Leah H. Gold

Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…

符号计算 · 计算机科学 2019-09-12 Matías Bender , Jean-Charles Faugère , Ludovic Perret , Elias Tsigaridas

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

交换代数 · 数学 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

交换代数 · 数学 2009-11-16 Masahiro Ohtani

We consider representations of rational Cherednik algebras which are particular ideals in the ring of polynomials. We investigate convergence of the integrals which express the Gaussian inner product on these representations. We derive that…

表示论 · 数学 2012-01-31 Misha Feigin , Constantin Shramov

We introduce and study the toric fiber product of two ideals in polynomial rings that are homogeneous with respect to the same multigrading. Under the assumption that the set of degrees of the variables form a linearly independent set, we…

交换代数 · 数学 2007-05-23 Seth Sullivant

We give a parametrization of square roots of the ideal class of the inverse different of rings defined by binary forms in terms of the orbits of a coregular representation. This parametrization, which can be construed as a new integral…

数论 · 数学 2024-09-04 Ashvin Swaminathan

An old theorem of Ad\'amek constructs initial algebras for sufficiently cocontinuous endofunctors via transfinite iteration over ordinals in classical set theory. We prove a new version that works in constructive logic, using "inflationary"…

逻辑 · 数学 2022-11-04 Andrew M. Pitts , S. C. Steenkamp