Related papers: String C-group representations of alternating grou…

A class of groups is investigated, each of which has a fairly simple presentation . For example the group $R = (a, b, c, d | a^3 = b^3 = c^3 = d^3 = 1, ba^{-1} =dc^{-1}, ca^{-1} = db^{-1}) $ is in the class. Such a group does not have as a…

We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

We prove that there exists a constant $c>0$ such that any finite group having no non-trivial mixed identity of length $\leq c$ is an almost simple group with a simple group of Lie type as its socle. Starting the study of mixed identities…

We show that for finite n at least 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an…

We describe Markov interval maps via branching systems and develop the theory of relative branching systems, characterizing when the associated representations of relative graph C*-algebras are faithful. When the Markov interval maps $f$…

Let G be a finitely generated, torsion-free, two-step nilpotent group. Let C^*(G) be the universal C^*-algebra of G. We show that acsr(C^*(G)) = acsr(C((\hat{G})_1)), where for a unital C^*-algebra A, acsr(A) is the absolute connected…

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…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

We define C sequential optimization numbers, where C is a k+1-tuple vector. We prove that the unsigned Stirling numbers of first kind are (0,1) sequential optimization numbers. Many achievements of the Stirling numbers of first kind can be…

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

A set grading on the split simple Lie algebra of type $D_{13}$, that cannot be realized as a group-grading, is constructed by splitting the set of positive roots into a disjoint union of pairs of orthogonal roots, following a pattern…

A representation field for a non-maximal order $\Ha$ in a central simple algebra is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders containing a copy of $\Ha$. Not every…

We say that a sequence $a_1 \cdots a_{2t}$ of integers is repetitive if $a_i = a_{i+t}$ for every $i\in\{1,\ldots,t\}$. A walk in a graph $G$ is a sequence $v_1 \cdots v_r$ of vertices of $G$ in which $v_iv_{i+1}\in E(G)$ for every…

Spinor representation of group GL(4,R) on special spinor space is developed. Representation space has a structure of the fiber space with the space of diagonal metricses as the base and standard spinor space as typical fiber. Non-isometric…

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

We present a stable uniqueness theorem for non-unital C*-algebras. Generalized tracial rank one is defined for stably projectionless simple C*-algebras. Let $A$ and $B$ be two stably projectionless separable simple amenable C*-algebras with…

In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.

We show that an infinite group is definable in any non trivial geometric $C$-minimal structure which is definably maximal and does not have any definable bijection between a bounded interval and an unbounded one in its canonical tree. No…

An $r$-uniform \textit{linear cycle} of length $\ell$, denoted by $C_{\ell}^r$, is an $r$-graph with edges $e_1, \ldots, e_{\ell}$ such that for every $i\in [\ell-1]$, $|e_i\cap e_{i+1}|=1$, $|e_{\ell}\cap e_1|=1$ and $e_i\cap…

We prove that for all positive integers $n$ and $k$, there exists an integer $N = N(n,k)$ satisfying the following. If $U$ is a set of $k$ direction vectors in the plane and $\mathcal{J}_U$ is the set of all line segments in direction $u$…