Related papers: Algebraic sets of types A, B, and C coincide

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

We introduce the notion of relation type of an affine algebra and prove that it is well defined by using the Jacobi-Zariski exact sequence of Andr\'e-Quillen homology. In particular, the relation type is an invariant of an affine algebraic…

We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.

Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the…

Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…

We define a variety of notions of cubical sets, based on sites organized using substructural algebraic theories presenting PRO(P)s or Lawvere theories. We prove that all our sites are test categories in the sense of Grothendieck, meaning…

It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…

If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of…

The algebraic geometry of a universal algebra $\mathbf{A}$ is defined as the collection of solution sets of term equations. Two algebras $\mathbf{A}_1$ and $\mathbf{A}_2$ are called algebraically equivalent if they have the same algebraic…

We prove that the number of geometrically indecomposable representations of fixed dimension vector d of a canonical algebra C defined over a finite field Fq is given by a polynomial in q (depending on C and d). We prove a similar result for…

Let $f\in \mathbb{R}[x, y, z]$ be a quadratic polynomial that depends on each variable and that does not have the form $g(h(x)+k(y)+l(z))$. Let $A, B, C$ be compact sets in $\mathbb{R}$. Suppose that $\dim_H(A)+\dim_H(B)+\dim_H(C)>2$, then…

We prove bounds for the volume of neighborhoods of algebraic sets, in the euclidean space or the sphere, in terms of the degree of the defining polynomials, the number of variables and the dimension of the algebraic set, without any…

A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed…

We give conditions under which a germ of a holomorphic mapping in $\Bbb C^N$, mapping an irreducible real algebraic set into another of the same dimension, is actually algebraic. Let $A\subset \bC^N$ be an irreducible real algebraic set.…

The constraint satisfaction problem (CSP) on a relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is a assignment to the variables satisfying all of the…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

For an arbitrary group, the subgroups form a lattice with order determined by set inclusion. Not every lattice is isomorphic to the subgroup lattice for a group. However, Birkhoff and Frink proved that any compactly generated lattice is…

In this paper we classify triangular semisimple and cosemisimple Hopf algebras over any algebraically closed field k. Namely, we construct, for each positive integer N, relatively prime to the characteristic of k if it is positive, a…