Related papers: Solution sets of systems of equations over finite …
We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…
In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…
The notion of an internal preneighbourhood space on a finitely complete category with finite coproducts and a proper $(\mathsf{E}, \mathsf{M})$ system such that for each object $X$ the set of $\mathsf{M}$-subobjects of $X$ is a complete…
A classical tensor product $A \,\otimes\, B$ of complete lattices $A$ and $B$, consisting of all down-sets in $A \times B$ that are join-closed in either coordinate, is isomorphic to the complete lattice $Gal(A,B)$ of Galois maps from $A$…
The universal centralizer of a semisimple algebraic group is the family of centralizers of regular elements, parametrized by their conjugacy classes. When the group is of adjoint type, we construct a smooth, log-symplectic fiberwise…
We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…
The goal of this paper is to describe the structure of finite-dimensional semi-simple Leibniz algebras in characteristic zero. Our main tool in this endeavor are hemi-semidirect products. One of the major results of this paper is a…
We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…
We prove that, under mild hypothesis, every normal algebraic space which satisfies the $1$-resolution property is quasi-affine. More generally, we show that for algebraic stacks satisfying similar hypotheses, the 1-resolution property…
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…
We present several equivalent conditions of the continuity of the supremum function from the square of the Scott space of $C(X)$ to itself under mild assumptions, where $C(X)$ denotes the lattice of closed subsets of a $\mathbf{T_0}$…
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
Semidefinite programs (SDP) are one of the most versatile frameworks in numerical optimization, serving as generalizations of many conic programs and as relaxations of NP-hard combinatorial problems. Their main drawback is their…
In this paper we characterize the definiteness of the discrete symplectic system, study a nonhomogeneous discrete symplectic system, and introduce the minimal and maximal linear relations associated with these systems. Fundamental…
We introduce the notion of accurate foundation sets and the accurate refinement property for right LCM semigroups. For right LCM semigroups with this property, we derive a more explicit presentation of the boundary quotient. In the context…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…