Related papers: Algebraic classification of 2+1 geometries
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
In the present paper, we introduce two-dimensional categorified Hall algebras of smooth curves and smooth surfaces. A categorified Hall algebra is an associative monoidal structure on the stable $\infty$-category…
We use the 1+1+2 covariant approach to clarify a number of aspects of spherically symmetric solutions of non-minimally coupled scalar tensor theories. Particular attention is focused on the extension of Birkhoff's theorem and the nature of…
A hard hadron-collider event is treated here as a single geometric object - the kinematics and the discrete object-type labels of all reconstructed final-state particles encoded in one multivector $\evMV\in\Cl(1,3)\otimes\Vflav$ - rather…
The theory of algebras with polynomial identities has developed significantly, with special attention devoted to the classification of varieties according to the asymptotic behavior of their codimension sequences. This sequence is a…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
We use the computer algebra system GAP to classify modular data up to rank 12. This extends the previously obtained classification of modular data up to rank 6. Our classification includes all the modular data from modular tensor categories…
In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…
In 1990 Kantor defined the conservative algebra $W(n)$ of all algebras (i.e. bilinear maps) on the $n$-dimensional vector space. If $n>1$, then the algebra $W(n)$ does not belong to any well-known class of algebras (such as associative,…
This letter deals with the problem of clutter edge detection and localization in training data. To this end, the problem is formulated as a binary hypothesis test assuming that the ranks of the clutter covariance matrix are known, and…
Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…
A new approach for the classification of the cosmic web is presented. In extension of the previous work of Hahn et al. (2007) and Forero-Romero et al. (2009) the new algorithm is based on the analysis of the velocity shear tensor rather…
We study the space-time geometry generated by coupling a free scalar field with a non-canonical kinetic term to General Relativity in $(2+1)$ dimensions. After identifying a family of scalar Lagrangians that yield exact analytical solutions…
We address the problem of classification of integrable differential-difference equations in 2+1 dimensions with one/two discrete variables. Our approach is based on the method of hydrodynamic reductions and its generalisation to dispersive…
Tannaka duality and its extensions by Lurie, Sch\"appi et al. reveal that many schemes as well as algebraic stacks may be identified with their tensor categories of quasi-coherent sheaves. In this thesis we study constructions of cocomplete…
Because of the attractiveness of the canonical polyadic (CP) tensor decomposition in various applications, several algorithms have been designed to compute it, but efficient ones are still lacking. Iterative deflation algorithms based on…
We study a series of real nonassociative algebras $\mathbb{O}_{p,q}$ introduced in $[5]$. These algebras have a natural $\mathbb{Z}_2^n$-grading, where $n=p+q$, and they are characterized by a cubic form over the field $\mathbb{Z}_2$. We…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
Well-known quantum machine learning techniques, namely quantum kernel assisted support vector machines (QSVMs) and quantum convolutional neural networks (QCNNs), are applied to the binary classification of pulsars. In this comparitive study…