English
Related papers

Related papers: Efficient simplicial replacement of semi-algebraic…

200 papers

Let $F\in \mathbb{K}[X, Y ]$ be a polynomial of total degree $D$ defined over a perfect field $\mathbb{K}$ of characteristic zero or greater than $D$. Assuming $F$ separable with respect to $Y$ , we provide an algorithm that computes the…

Algebraic Geometry · Mathematics 2018-12-05 Adrien Poteaux , Martin Weimann

In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

We give a simple explanation of numerical experiments of V. Arnold with two sequences of symmetric numerical semigroups, S(4,6+4k,87-4k) and S(9,3+9k,85-9k) generated by three elements. We present a generalization of these sequences by…

Number Theory · Mathematics 2009-03-24 Leonid G. Fel

Algorithms are described that help with obtaining a classification of the semisimple subalgebras of a given semisimple Lie algebra, up to linear equivalence. The algorithms have been used to obtain classifications of the semisimple…

Rings and Algebras · Mathematics 2010-04-13 Willem A. de Graaf

Two subanalytic subsets of $ \mathbb R^n$ are called $s$-equivalent at a common point $P$ if the Hausdorff distance between their intersections with the sphere centered at $P$ of radius $r$ vanishes to order $>s$ as $r$ tends to $0$. In…

Algebraic Geometry · Mathematics 2020-05-13 M. Ferrarotti , E. Fortuna , L. Wilson

We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the…

Algebraic Topology · Mathematics 2011-05-19 Rocio Gonzalez-Diaz , Pedro Real

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…

Group Theory · Mathematics 2016-03-21 Attila Földvári

Let $K$ be a number field and $A/K$ be an abelian variety of dimension $g$. Assuming that the image $G_{\ell^\infty}$ of the natural Galois representation attached to the Tate module $T_\ell(A)$ is $\operatorname{GSp}_{2g}(\mathbb{Z}_\ell)$…

Number Theory · Mathematics 2025-02-13 Matthew Bisatt , Davide Lombardo

Given $1\le \ell <k$ and $\delta\ge0$, let $\textbf{PM}(k,\ell,\delta)$ be the decision problem for the existence of perfect matchings in $n$-vertex $k$-uniform hypergraphs with minimum $\ell$-degree at least $\delta\binom{n-\ell}{k-\ell}$.…

Combinatorics · Mathematics 2026-03-30 Luyining Gan , Jie Han

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

Optimization and Control · Mathematics 2008-09-09 Jiawang Nie , Kristian Ranestad , Bernd Sturmfels

Let $\Delta$ be an one-dimensional simplicial complex on $\{1,2,\ldots,s\}$ and $S$ the polynomial ring $K[x_1,\ldots,x_s]$ over a field $K$. The explicit formula for $a_0(S/I_{\Delta}^n)$ is presented when $\mathrm{girth}(\Delta)\geq 4$.…

Commutative Algebra · Mathematics 2022-12-06 Lizhong Chu , Dancheng Lu

The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…

Computational Complexity · Computer Science 2021-11-18 Chris Jones , Aaron Potechin , Goutham Rajendran , Madhur Tulsiani , Jeff Xu

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

Artificial Intelligence · Computer Science 2011-07-25 Thierry Boy de la Tour , Mnacho Echenim

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

Algebraic Geometry · Mathematics 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane

We exhibit a correspondence between subcategories of modules over an algebra and sub-bimodules of the dual of that algebra. We then prove that the semisimplicity of certain such categories is equivalent to the existence of a Peter-Weyl…

Quantum Algebra · Mathematics 2015-09-08 John E. Foster

We carry out the complete group classification of the class of (1+1)-dimensional linear Schr\"odinger equations with complex-valued potentials. After introducing the notion of uniformly semi-normalized classes of differential equations, we…

Mathematical Physics · Physics 2018-03-07 Célestin Kurujyibwami , Peter Basarab-Horwath , Roman O. Popovych

We show that a differential algebraic group can be filtered by a finite subnormal series of differential algebraic groups such that successive quotients are almost simple, that is have no normal subgroups of the same type. We give a…

Classical Analysis and ODEs · Mathematics 2010-10-11 Phyllis J. Cassidy , Michael F. Singer

Extending the model of the interval, we explicitly define for each $n\ge 0$ a free complete differential graded Lie algebra $\mathfrak{L}_n$ generated by the simplices of $\Delta^n$, with desuspended degrees, in which the vertices are…

Algebraic Topology · Mathematics 2021-01-11 Urtzi Buijs , Yves Félix , Aniceto Murillo , Daniel Tanré

In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of…

Computational Complexity · Computer Science 2025-11-19 Nader H. Bshouty

Let $\mathcal{O}$ be an order in an algebraic number field and suppose that the set of distances $\Delta(\mathcal{O})$ of $\mathcal{O}$ is nonempty (equivalently, $\mathcal{O}$ is not half-factorial). If $\mathcal{O}$ is seminormal (in…

Number Theory · Mathematics 2023-10-30 Andreas Reinhart
‹ Prev 1 8 9 10 Next ›