Related papers: Algorithmic and topological aspects of semi-algebr…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

We design new polynomial-time algorithms for recovering planted cliques in the semi-random graph model introduced by Feige and Kilian 2001. The previous best algorithms for this model succeed if the planted clique has size at least…

We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self…

We consider semigroup dynamical systems defined by several polynomials over a number field $\mathbb{K}$, and the orbit (tree) they generate at a given point. We obtain finiteness results for the set of preperiodic points of such systems…

In this paper, based on the homotopy continuation method and the interval Newton method, an efficient algorithm is introduced to isolate the real roots of semi-algebraic system. Tests on some random examples and a variety of problems…

Let $A$ be a finite dimensional associative $\mathbb{K}$-algebra over an algebraically closed field $\mathbb{K}$ of characteristic zero. To $A$, we can associate its basic form that is given by a quiver $Q = (Q_0, Q_1)$ with an admissible…

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

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…

We define a Grothendieck ring for basic real semialgebraic formulas, that is for systems of real algebraic equations and inequalities. In this ring the class of a formula takes into consideration the algebraic nature of the set of points…

We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into several parts. The replication factor of a vertex $v$ is the number of parts that contain edges incident to $v$. The goal is to minimize…

In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finitely many basic semi-algebraic convex sets. We establish an explicit convergence rate estimate which relies on the maximum degree of the…

We present a general technique, based on parametric search with some twist, for solving a variety of optimization problems on a set of semi-algebraic geometric objects of constant complexity. The common feature of these problems is that…

A Cylindrical Algebraic Decomposition (CAD) is a decomposition of R^n into a finite collection of semialgebraic cells. A CAD satisfies the "frontier condition" if, for every cell C, there is a collection of cells of the decomposition whose…

This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…

We introduce several new quantum algorithms for estimating homological invariants, specifically Betti numbers and persistent Betti numbers, of a simplicial complex given via a structured classical input. At the core of our algorithm lies…

We provide a structure theorem for all almost complete intersection ideals of depth three in any Noetherian local ring. In particular, we find that the minimal generators are the pfaffians of suitable submatrices of an alternating matrix.…

Let V be a semialgebraic set parameterized by quadratic polynomials over a quadratic set T. This paper studies semidefinite representation of its convex hull by projections of spectrahedra (defined by linear matrix inequalities). When T is…

For a digraph $\Gamma$, if $F$ is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of $\Gamma$, then $F$ is called the splitting field of $\Gamma$. The extension degree of $F$ over the…

The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, Scott, and…