Related papers: Computability and Categoricity of Weakly Ultrahomo…
Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…
It is shown that the countably infinite dimensional pointed vector space (the vector space equipped with a constant) over a finite field has infinitely many first order definable reducts. This implies that the countable homogeneous…
Two approaches to Lipschitz structures for any set are presented, studied and compared. The first approach is similar to the one proposed in Fraser, Jr. R. B., Axiom systems for Lipschitz structures, Fundamenta Mathematicae, (1970), where…
We introduce and study a nontrivial generalization of uniserial modules and rings. A module is called weakly uniserial if its submodules are comparable regarding embedding. Also, a right (resp., left) weakly uniserial ring is a ring which…
We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…
We classify the ultrahomogeneous complete 3-edge-coloured graphs (3-graphs) with simple theory. This extends Lachlan's result (a corollary of the Effective Classification Theorem for stable structures) classifying the stable homogeneous…
$\kC$ clustering is a fundamental classification problem, where the task is to categorize the given collection of entities into $k$ clusters and come up with a representative for each cluster, so that the maximum distance between an entity…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…
This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system…
We explicitly construct the structure of Jacquet modules of parabolically induced representations of even unitary groups and even general unitary groups over a $p$-adic field $F$ of characteristic different than two. As an application, we…
A C*-algebra is n-homogeneous (where n is finite) if every its nonzero irreducible representation acts on an n-dimensional Hilbert space. An elementary proof of Fell's characterization of n-homogeneous C*-algebras (by means of their…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
Fixed effects models are very flexible because they do not make assumptions on the distribution of effects and can also be used if the heterogeneity component is correlated with explanatory variables. A disadvantage is the large number of…
The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components…