English
Related papers

Related papers: Notes on algebra and geometry of polynomial repres…

200 papers

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini

In this paper we consider the problem of bounding the Betti numbers, $b_i(S)$, of a semi-algebraic set $S \subset \R^k$ defined by polynomial inequalities $P_1 \geq 0,...,P_s \geq 0$, where $P_i \in \R[X_1,...,X_k]$ and $\deg(P_i) \leq 2$,…

Algebraic Geometry · Mathematics 2011-02-21 Saugata Basu , Michael Kettner

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Algebraic Geometry · Mathematics 2017-05-01 Saugata Basu , Cordian Riener

We parameterize the finite-dimensional irreducible representations of a class of pointed Hopf algebras over an algebraically closed field of characteristic zero by dominant characters. The Hopf algebras we are considering arise in the work…

Quantum Algebra · Mathematics 2007-05-23 David E. Radford , Hans-Jürgen Schneider

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Combinatorics · Mathematics 2025-07-23 Niels Lubbes , Mehdi Makhul , Josef Schicho , Audie Warren

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…

Combinatorics · Mathematics 2014-03-04 Kevin Woods

We consider algebras over a field K defined by a presentation K <x_1,..., x_n : R >, where $R$ consists of n choose 2 square-free relations of the form x_i x_j = x_k x_l with every monomial x_i x_j, i different from j, appearing in one of…

Rings and Algebras · Mathematics 2007-05-23 T. Gateva-Ivanova , Eric Jespers , Jan Okninski

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

Commutative Algebra · Mathematics 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

Number Theory · Mathematics 2024-05-07 Anton Shakov

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

Rings and Algebras · Mathematics 2014-09-04 Sophie Frisch

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Carsten Schneider

In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…

Algebraic Geometry · Mathematics 2023-09-04 Dang Tuan Hiep , Nguyen Thi Ngoc Giao , Nguyen Thi Mai Van

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

Representation Theory · Mathematics 2018-03-06 Vladimir V. Kornyak

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

Let $A_g$ be an abelian variety of dimension $g$ and $p$-rank $\lambda \leq 1$ over an algebraically closed field of characteristic $p>0$. We compute the number of homomorphisms from $\pi_1^{\text{\'et}}(A_g,a)$ to $GL_n(\mathbb F_q)$,…

Algebraic Geometry · Mathematics 2018-06-22 Brett Frankel

We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.

Commutative Algebra · Mathematics 2023-01-31 Riccardo Camerlo , Carla Massaza

Let H denote a semisimple Hopf algebra over an algebraically closed field k of characteristic 0. We show that the degree of any irreducible representation of H whose character belongs to the center of H^* must divide the dimension of H .

Rings and Algebras · Mathematics 2007-05-23 Martin Lorenz

The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…

Numerical Analysis · Mathematics 2024-03-28 Emma R. Cobian , Jonathan D. Hauenstein , Charles W. Wampler
‹ Prev 1 4 5 6 7 8 10 Next ›