Related papers: Connectivity in Symmetric Semi-Algebraic Sets
Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…
We isolate a class, say $\mathcal{A}$, of global real analytic functions such that, each global semi-analytic set defined by $\mathcal{A}$ has only finitely many connected components and each component is also a global semi-analytic set…
For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…
A sequence is difference algebraic (or D-algebraic) if finitely many shifts of its general term satisfy a polynomial relationship; that is, they are the coordinates of a generic point on an affine hypersurface. The corresponding equations…
The purpose of this paper is to give an updated survey on various algebraic and analytic properties of semigroups related to fixed point properties of semigroup actions on a non-empty closed convex subset of a Banach space or, more…
We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity and as well as the full spectrum distribution.…
A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…
We introduce algebraic sets in the products of complex projective spaces for the mixed states in multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear…
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…
Let us consider a linear control system \Sigma on a connected Lie group G. It is known that the accessibility set A from the identity e is in general not a semigroup. In this article we associate a new algebraic object S to \Sigma which…
Two plane analytic branches are topologically equivalent if and only if they have the same multiplicity sequence. We show that having same semigroup is equivalent to having same multiplicity sequence, we calculate the semigroup from a…
The existence of a semiconjugate relation permits the transformation of a higher order difference equation on a group into an equivalent triangular system of two difference equations of lower orders. Introducing time-dependent form…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
Every semigroup containing an ideal subgroup is called a homogroup, and it is a grouplike if and only if it has only one central idempotent. On the other hand, a class of algebraic structures covering group-$e$-semigroups…
Studied here is the effect of the presence of symmetry groups in a system of algebraic equations on the numerical resolution with fixed-point algorithms. It is proved that the symmetries imply two important properties of the system: 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…
Algebraic quantization scheme has been proposed as an extension of the Dirac quantization scheme for constrained systems. Semi-classical states for constrained systems is also an independent and important issue, particularly in the context…
A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. For a finite simple semigroup we find necessary and sufficient conditions to be an equational domain. Moreover, we study semigroups…
We give a brief account of a construction called tokens here, which is significant in algebra, analysis, combinatorics, and physics. Tokens allow to express a semigroup on one set via a semigroup convolution on another set. Therefore tokens…
We present a criterion of local Normal Embedding of a semialgebraic (or definable in an o-minimal structure) contained in $R^n$ in terms orders of contact of arcs. Namely, we prove that a semialgebraic set is normally embedded at a point x…