English
Related papers

Related papers: Multivariate Polynomials in Sage

200 papers

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Logic in Computer Science · Computer Science 2023-05-23 Donghyun Lim , Martin Ziegler

This paper investigates the number of supports of the Schubert polynomial $\mathfrak{S}_w(x)$ indexed by a permutation $w$. This number also equals the number of lattice points in the Newton polytope of $\mathfrak{S}_w(x)$. We establish a…

Combinatorics · Mathematics 2024-12-05 Peter L. Guo , Zhuowei Lin

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

Information Theory · Computer Science 2014-04-11 E. Bellini , I. Simonetti , M. Sala

The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…

Computational Complexity · Computer Science 2010-07-19 Zhixiang Chen , Bin Fu

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

Combinatorics · Mathematics 2009-11-16 Julian Pfeifle

Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…

Rings and Algebras · Mathematics 2024-12-13 A. S. Gordienko

Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…

Symbolic Computation · Computer Science 2019-05-14 Seung Gyu Hyun , Vincent Neiger , Éric Schost

For any unbranched double covering of compact Riemann surfaces, we study the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We introduce $k>0$…

Algebraic Geometry · Mathematics 2022-03-03 Cheng Shu

The concepts of evaluation and interpolation are extended from univariate skew polynomials to multivariate skew polynomials, with coefficients over division rings. Iterated skew polynomial rings are in general not suitable for this purpose.…

Rings and Algebras · Mathematics 2018-11-02 Umberto Martínez-Peñas , Frank R. Kschischang

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

Combinatorics · Mathematics 2023-06-21 Philippe Nadeau , Vasu Tewari

We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of…

Logic in Computer Science · Computer Science 2023-06-22 A. M. Ben-Amram , G. W. Hamilton

In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…

Symbolic Computation · Computer Science 2013-03-01 Hongbo Li

We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…

Classical Analysis and ODEs · Mathematics 2019-11-20 Genki Shibukawa

We introduce the new sage_acsv package for the SageMath computer algebra system, allowing users to rigorously compute asymptotics for a large variety of multivariate sequences with rational generating functions. Using Sage's support for…

Combinatorics · Mathematics 2023-09-04 Benjamin Hackl , Andrew Luo , Stephen Melczer , Jesse Selover , Elaine Wong

For any branched double covering of compact Riemann surfaces, we consider the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We restrict the…

Algebraic Geometry · Mathematics 2023-12-20 Cheng Shu

We provide a self-contained introduction to Gr\"obner bases of submodules of $R[x_1, \ldots, x_n]^k$, where $R$ is a Euclidean domain, and explain how to use these bases to solve linear systems over $R[x_1, \ldots, x_n]$.

Commutative Algebra · Mathematics 2024-11-06 Erhard Aichinger

This paper introduces a new generalized polynomial chaos expansion (PCE) comprising measure-consistent multivariate orthonormal polynomials in dependent random variables. Unlike existing PCEs, whether classical or generalized, no…

Probability · Mathematics 2018-04-17 Sharif Rahman

The goal of the paper is to analyze a Gaudin model for a polynomial representation of the Kohno-Drinfeld Lie algebra associated with the multinomial distribution. The main result is the construction of an explicit basis of the space of…

Mathematical Physics · Physics 2024-03-01 Plamen Iliev

In this paper we present a first approach toward a \texttt{SAGBI} bases theory of skew Poincar\'e-Birkhoff-Witt extensions, and investigate the problem of polynomial composition for \texttt{SAGBI} bases of subalgebras of these extensions.

Quantum Algebra · Mathematics 2025-08-15 Yésica Suárez , Armando Reyes

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

Symbolic Computation · Computer Science 2022-02-16 Xavier Caruso , Tristan Vaccon , Thibaut Verron
‹ Prev 1 3 4 5 6 7 10 Next ›