Related papers: On Minimum CADs for Algebraic Sets in Dimension Th…
A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the…
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…
The classification, up to a center-affinity, of the homogeneous quadratic differential systems defined on $\mathbb{R}^{3}$ that have at least a semisimple derivation with one-dimensional kernel, is achieved. It is proved that there exist 35…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
We construct the well-known decomposition of the Lie algebra $\mathfrak{e}_8$ into representations of $\mathfrak{e}_6\oplus\mathfrak{su}(3)$ using explicit matrix representations over pairs of division algebras. The minimal representation…
Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder. The location of the axis and the radius of the…
The Cylindrical Algebraic Decomposition (CAD) algorithm is a comprehensive tool to perform quantifier elimination over real closed fields. CAD has doubly exponential running time, making it infeasible for practical purposes. We propose to…
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…
In this paper many classes of sets of matrices with entries in F (F=R, F=C, F=H) are introduced. Each class with the corresponding topology determines a real analytical, complex or symplectic manifold for F=R, F=C or F=H respectively. Any…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…
A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed. The new operator computes the intersection of projection factor sets produced by different CAD projection orders. In other words, it computes the gcd…
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…
CFTs are naturally defined on Riemann surfaces. The rational ones can be solved using methods from algebraic geometry. One particular feature is the covariance of the partition function under the mapping class group. In genus $g=1$, this…
Optimization decomposition methods are a fundamental tool to develop distributed solution algorithms for large scale optimization problems arising in fields such as machine learning and optimal control. In this paper, we present an…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
Let $\Gamma$ be a $T$-ideal of identities of an affine PI-algebra over an algebraically closed field $F$ of characteristic zero. Consider the family $\mathcal{M}_{\Gamma}$ of finite dimensional algebras $\Sigma$ with $Id(\Sigma) = \Gamma$.…
We give two low-complexity algorithms, one for dimensionality reduction and one for dimensionality increase, which are applicable to any dataset, regardless of whether the set has an intrinsic dimension or not. The corresponding methods…
We study stable subspaces of positive extremal maps of finite dimensional matrix algebras that preserve trace and matrix identity (so-called bistochastic maps). We have established the existence of the isometric-sweeping decomposition for…