English
Related papers

Related papers: Regular cylindrical algebraic decomposition

200 papers

Let $T$ be a bounded quaternionic normal operator on a right quaternionic Hilbert space $\mathcal{H}$. We show that $T$ can be factorized in a strongly irreducible sense, that is, for any $\delta >0$ there exist a compact operator $K$ with…

Functional Analysis · Mathematics 2020-10-15 P. Santhosh Kumar

Given any arbitrary semi-algebraic set $X$, any two points in $X$ may be joined by a piecewise $C^2$ path $\gamma$ of shortest length. Suppose $\mathcal{A}$ is a semi-algebraic stratification of $X$ such that each component of $\gamma \cap…

Algebraic Geometry · Mathematics 2021-02-19 Chengcheng Yang

In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…

Rings and Algebras · Mathematics 2025-05-14 Tianran Hua , Ekaterina Napedenina , Marina Tvalavadze

Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…

Combinatorics · Mathematics 2016-04-20 Jin Guo , Yi-Huang Shen , Tongsuo Wu

A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean…

Computational Geometry · Computer Science 2019-08-27 Jeffrey Danciger , Sara Maloni , Jean-Marc Schlenker

We show that a subset of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ is well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$ (denoting the complexities of the linear and quadratic part,…

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

In this paper, we find criteria for when cyclic cubic and cyclic quartic fields have well-rounded ideal lattices. We show that every cyclic cubic field has at least one well-rounded ideal. We also prove that there exist families of cyclic…

Number Theory · Mathematics 2024-02-14 Dat T. Tran , Nam H. Le , Ha T. N. Tran

Let $R$ be a finite commutative ring with identity. In this paper, we give a necessary condition for the existence of an orthogonal decomposition of the special linear Lie algebra over $R$. Additionally, we study orthogonal decompositions…

Rings and Algebras · Mathematics 2019-01-08 Songpon Sriwongsa

We construct examples of complex algebraic surfaces not admitting normal embeddings (in the sense of semialgebraic or subanalytic sets) with image a complex algebraic surface.

Algebraic Geometry · Mathematics 2011-07-29 Lev Birbrair , Alexandre Fernandes , Walter D Neumann

Given a triangulated category $\mathcal{C}$, we construct a partial compactification, denoted $\mathcal{A}\mathrm{Stab}(\mathcal{C})$, of the quotient of its stability manifold by $\mathbb{C}$. The purpose of…

Algebraic Geometry · Mathematics 2025-01-03 Daniel Halpern-Leistner , Antonios-Alexandros Robotis

We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…

Optimization and Control · Mathematics 2018-09-13 Amir Ali Ahmadi , Georgina Hall

We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…

Dynamical Systems · Mathematics 2025-08-06 Marcelo P. Santos , Leon D. da Silva

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

Optimization and Control · Mathematics 2008-02-12 Jiawang Nie , Kristian Ranestad

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

Optimization and Control · Mathematics 2009-02-14 Yoshiyuki Sekiguchi , Tomoyuki Takenawa , Hayato Waki

The classical Theorem of Mumford states that a topologically regular complex algebraic surface in $\mathbb{C}^3$ with an isolated singular point is smooth. We proof that any Lipschitz regular complex algebraic set is smooth. No restriction…

Algebraic Geometry · Mathematics 2014-05-08 Lev Birbrair , Alexandre Fernandes , Edson Sampaio , Lê D. Trang

A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e…

Combinatorics · Mathematics 2015-04-03 Christina , Mynhardt , Christopher van Bommel

We show the possibility and the uniqueness of polar decomposition of elements of arbitrary AW*-algebras inside them. We prove that spectral decomposition of normal elements of normal AW*-algebras is possible and unique inside them. The…

funct-an · Mathematics 2008-02-03 Michael Frank

It is known for scalar ordinary differential equations, and for systems of ordinary differential equations of order not higher than the third, that their Lie point symmetry algebras is of maximal dimension if and only if they can be reduced…

Classical Analysis and ODEs · Mathematics 2016-06-28 J. C. Ndogmo

A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…

Optimization and Control · Mathematics 2026-04-03 Wenqi Zhu , Coralia Cartis

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter