Related papers: Cylindrical Algebraic Decomposition With Frontier …
Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…
This paper studies the algebraic boundary of the elliptope $\mathcal{E}(G)$ of a graph $G$. In particular, we completely characterize the algebraic boundary of $\mathcal{E}(G)$ when $G$ is cycle completable. In this case, the boundary is a…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
We explore the finite-dimensional part of the non-commutative Choquet boundary of an operator algebra. In other words, we seek finite-dimensional boundary representations. Such representations may fail to exist even when the underlying…
An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…
We present a model-independent study of boundary states in the Cardy case that covers all conformal field theories for which the representation category of the chiral algebra is a - not necessarily semisimple - modular tensor category. This…
A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex…
Inspired by rational canonical forms, we introduce and analyze two decompositions of dynamic programming (DP) problems for systems with linear dynamics. Specifically, we consider both finite and infinite horizon DP problems in which the…
The linearization of a quadratic form gives rise to a Clifford algebra structure, as seen in Dirac's factorization of the d'Alembert operator. A similar structure known as a generalized Clifford algebra arises from the continuation of this…
A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the…
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…
Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity (AC) properties are proposed. The algorithms are based on a framework for…
Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a…
We introduce the concept of boundary degeneracy of topologically ordered states on a compact orientable spatial manifold with boundaries, and emphasize that the boundary degeneracy provides richer information than the bulk degeneracy.…