English
Related papers

Related papers: Almost Vanishing Polynomials for Sets of Limited P…

200 papers

Let G be a graph obtained by taking r>=2 paths and identifying all first vertices and identifying all the last vertices. We compute the Castelnuovo--Mumford regularity of the quotient S/I(X), where S is the polynomial ring on the edges of G…

Commutative Algebra · Mathematics 2016-06-29 Antonio Macchia , Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…

Symbolic Computation · Computer Science 2010-01-06 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

Algebraic Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Ludwig Bröcker

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Combinatorics · Mathematics 2022-08-01 Robert Davis , Florian Kohl

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

Combinatorics · Mathematics 2020-09-28 Radhika Gupta , Ivan Levcovitz , Alexander Margolis , Emily Stark

Let $\mathbb{F}_q$ be a finite field, let $\mathbb{X}$ be a subset of a projective space ${\mathbb P}^{s-1}$, over the field $\mathbb{F}_q$, parameterized by rational functions, and let $I(\mathbb{X})$ be the vanishing ideal of…

Commutative Algebra · Mathematics 2019-04-04 Azucena Tochimani , Rafael H. Villarreal

Let $G$ be a group and let $X$ be a transitive $G$-space. We classify the subsets of $X$ with respect to a translation invariant ideal $\mathcal{J}$ in the Boolean algebra of all subsets of $X$, introduce and apply the relative…

Group Theory · Mathematics 2014-09-26 Igor Protasov , Sergii Slobodianiuk

Let $X$ be a smooth irreducible quasi-projective algebraic variety over a number field $K$. Suppose $X$ is equipped with a $p$-adic \'{e}tale local system compatible with an admissible graded-polarized variation of mixed Hodge structures on…

Number Theory · Mathematics 2025-08-15 Kenneth Chung Tak Chiu

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

Commutative Algebra · Mathematics 2011-05-18 G. -M. Greuel , F. Seelisch , O. Wienand

For quadratic polynomials with an indifferent fixed point with bounded type rotation number (they have a Siegel disk), much of what is known of their Julia set comes from the study of a quasiconformal model. The model is build from a…

Dynamical Systems · Mathematics 2007-05-23 Arnaud Cheritat

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

Algebraic Geometry · Mathematics 2010-07-30 Daniel Plaumann , Claus Scheiderer

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

Computational Geometry · Computer Science 2025-04-01 Adrian Dumitrescu

Let X be a complete toric variety with homogeneous coordinate ring S. In this article, we compute upper and lower bounds for the codimension in the critical degree of ideals of S generated by dim(X)+1 homogeneous polynomials that don't…

Algebraic Geometry · Mathematics 2007-05-23 David Cox , Alicia Dickenstein

We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…

Combinatorics · Mathematics 2018-03-14 William J. Martin , Douglas R. Stinson

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

Combinatorics · Mathematics 2014-09-02 Kathleen Nowak

For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…

Algebraic Geometry · Mathematics 2018-11-20 J. B. Lasserre , M. Laurent , P. Rostalski

For a given set of integers $\mathcal{S}$, let $\mathcal{R}_n^*(\mathcal{S})$ denote the set of reducible polynomials $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ over $\mathbb{Z}[X]$ with $a_i\in\mathcal{S}$ and $a_0a_n\ne 0$. In this…

Number Theory · Mathematics 2017-07-05 Shane Chern