English
Related papers

Related papers: Ideal-specific elimination orders form a star-shap…

200 papers

Gr\"obner bases have been generalized by replacing monomial orders with constructions such as valuations and filtrations. We consider suitable valuations on a rational valuation field $K(x,y)$ and analyze their behavior when restricting to…

Commutative Algebra · Mathematics 2018-06-01 Edward Mosteig

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

We study the extrinsic Bures--Wasserstein geometry of the determinant-normalized Kronecker model $\mcK_n=\{V\ot U:U,V\in\Sp^n,\ \det U=1\}\subset\Sp^{n^2}$, asking when the ambient Bures geodesic between two Kronecker positive definite…

Algebraic Geometry · Mathematics 2026-05-06 Jiaping Yang , Yunxin Zhang

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

Commutative Algebra · Mathematics 2019-12-13 John Abbott , Anna Maria Bigatti , Lorenzo Robbiano

We introduce a polynomial time algorithm for optimizing the class of star-convex functions, under no restrictions except boundedness on a region about the origin, and Lebesgue measurability. The algorithm's performance is polynomial in the…

Data Structures and Algorithms · Computer Science 2016-05-13 Jasper C. H. Lee , Paul Valiant

This work addresses arbitrary convex vector optimization problems, which constitute a general framework for multi-criteria decision-making in diverse real-world applications. Due to their complexity, such problems are typically tackled…

Optimization and Control · Mathematics 2026-03-31 Daniel Dörfler , Rebecca Köhler , Andreas Löhne

In this note we characterize isoperimetric regions inside almost-convex cones. More precisely, as in the case of convex cones, we show that isoperimetric sets are given by intersecting the cone with a ball centered at the origin.

Analysis of PDEs · Mathematics 2016-05-04 Eric Baer , Alessio Figalli

A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…

Combinatorics · Mathematics 2007-05-23 Serkan Hosten , Diane Maclagan , Bernd Sturmfels

We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires polynomials of odd degree up to n. This…

Commutative Algebra · Mathematics 2008-12-10 Seth Sullivant

Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…

Algebraic Geometry · Mathematics 2009-06-25 Cristiano Bocci , Brian Harbourne

Using the recent results on square-free Gr\"obner degenerations by Conca and Varbaro, we proved that if a homogeneous ideal $I$ of a polynomial ring is such that its initial ideal $\mathrm{in}_<(I)$ is square-free and $\beta_0(I) =…

Commutative Algebra · Mathematics 2023-03-31 Hongmiao Yu

We improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set $K\subset \mathbb{R}^n$ contained in a box of radius $R$, we show how to either find a…

Data Structures and Algorithms · Computer Science 2015-11-06 Yin Tat Lee , Aaron Sidford , Sam Chiu-wai Wong

In the book [FIM], original methods were proposed to determine the invariant measure of random walks in the quarter plane with small jumps, the general solution being obtained via reduction to boundary value problems. Among other things, an…

Probability · Mathematics 2014-11-11 Guy Fayolle , Roudolf Iasnogorodski

We establish a Crapo complementation formula for the M\"obius function $\mu^X$ in a general decomposition space $X$ in terms of a convex subspace $K$ and its complement: $\mu^X \simeq \mu^{X\setminus K} + \mu^X*\zeta^K*\mu^X$. We work at…

Category Theory · Mathematics 2024-09-06 Imma Gálvez-Carrillo , Joachim Kock , Andrew Tonks

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

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang

For polynomial ideals in positive charachteristic, defining $F$-split rings and admitting a squarefree monomial initial ideal are different notions. In this note we show that, however, there are strong interactions in both directions.…

Commutative Algebra · Mathematics 2021-07-27 Mitra Koley , Matteo Varbaro

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…

Commutative Algebra · Mathematics 2020-04-08 Mourtadha Badiane , Isaac Burke , Emil Sköldberg

For a simple complete ideal $\wp$ of a local ring at a closed point on a smooth complex algebraic surface, we introduce an algebraic object, named Poincar\'e series $P_{\wp}$, that gathers in an unified way the jumping numbers and the…

Algebraic Geometry · Mathematics 2008-07-12 Carlos Galindo , Francisco Monserrat

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…

Machine Learning · Computer Science 2021-05-26 Aïssatou Diallo , Johannes Fürnkranz
‹ Prev 1 8 9 10 Next ›