Related papers: Separation of Semialgebraic Sets

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

The set $S(n)$ of all elementary symmetric polynomials in $n$ variables is a minimal generating set for the algebra of symmetric polynomials in $n$ variables, but over a finite field ${\mathbb F}_q$ the set $S(n)$ is not a minimal…

We discuss recent developments in the study of semiorthogonal decompositions of algebraic varieties with an emphasis on their behaviour in families. First, we overview new results concerning homological projective duality. Then we introduce…

Almost all existing deep learning approaches for semantic segmentation tackle this task as a pixel-wise classification problem. Yet humans understand a scene not in terms of pixels, but by decomposing it into perceptual groups and…

Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on…

We investigate the relationship between coseparable and semisimple corings. In particular we prove that a coring over a separable algebra is coseparable if and only if it is absolutely semisimple.

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…

Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.

We introduce a procedure based on computational algebraic geometry to determine whether two algebras are isomorphic. We then apply it to show that if $R$ is a commutative unital ring in which $2$ is not invertible, $G$ is a group of order…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…

We derive polynomial identities of arbitrary degree $n$ for syzygies degrees of numerical semigroups S_m=<d_1,...,d_m> and show that for n>=m they contain higher genera G_r=\sum_{s\in Z_>\setminus S_m}s^r of S_m. We find a number…

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the…

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

We present a new notion of decomposition of semialgebraic sets by introducing a mode of irreducibility based on arc-analytic functions. The result is a refinement of the decomposition of such sets with respect to the Zariski topology as…