Related papers: Detecting Infinitely Many Semisimple Representatio…

We show that there exist infinitely many $n \in \mathbb{Z}^+$ such that for any constant $\epsilon > 0$, any deterministic algorithm to solve $k$-\textsf{SAT} for $k \geq 3$ must perform at least…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We show that for a fixed positive integer k one can efficiently decide if a finite algebra A admits a k-ary weak near unanimity operation by looking at the local behavior of the terms of A. We also observe that the problem of deciding if a…

For semisimple Lie superalgebras over an algebraically closed field of characteristic zero, whose category of finite dimensional super representations is semisismple, we classify all irreducible super representations for which the…

It is shown that the Gel'fand-Tsetlin realization of irreducible representations of the $A_n$ algebra is directly connected with a linear exactly integrable system in the n-dimensional space. General solution for this system is explicitly…

We describe all irreducible conformal subalgebras of Cend_N. The classification of simple and semisimple associative conformal algebras with finite faithful representation follows from this description.

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…

In this article, we give a classification of irreducible completely splittable representations of affine Hecke-Clifford superalgebras $H_n^{\mathrm{aff}}(q)$ when $q^2$ is a primitive $h$-th root of unity. As an application, we derive a…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

We classify the (semi-simple parts of the) Lie algebra of the Zariski closure of a discrete subgroup of a split simple real-algebraic Lie group, whose limit sets are minimal and such that the limit set in the space of full flags contains a…

In this paper, we are concerned with the problem of determining the existence of multiple equilibria in economic models. We propose a general and complete approach for identifying multiplicities of equilibria in semi-algebraic economies,…

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

Let A be a finitely generated commutative algebra over a field K with a presentation A=K < X_{1}, ..., X_{n} | R >, where R is a set of monomial relations in the generators X_{1}, ..., X_{n}. So A = K[S], the semigroup algebra of the monoid…

We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

A (positive definite and non-classic integral) quadratic form is called strongly $s$-regular if it satisfies a strong regularity property on the number of representations of squares of integers. In this article, we prove that for any…

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.

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of…