Related papers: Strong 1-boundedness, $L^2$-Betti numbers, algebra…

Dani and Mainkar introduced a method for constructing a 2-step nilpotent Lie algebra $\mathfrak{n}_G$ from a simple directed graph $G$ in 2005. There is a natural inner product on $\mathfrak{n}_G$ arising from the construction. We study…

In [BV12] we have proven that, for all hyperbolic groups and for all non-trivial free products $\Gamma$, the left-right wreath product group $G:=(Z/2Z)^{(\Gamma)} \rtimes (\Gamma \times \Gamma)$ is W$^*$-superrigid. In this paper, we extend…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

We show that if $\Gamma = \Gamma_1\times\dotsb\times \Gamma_n$ is a product of $n\geq 2$ non-elementary ICC hyperbolic groups then any discrete group $\Lambda$ which is $W^*$-equivalent to $\Gamma$ decomposes as a $k$-fold direct sum…

We define for arbitrary modules over a finite von Neumann algebra $\cala$ a dimension taking values in $[0,\infty]$ which extends the classical notion of von Neumann dimension for finitely generated projective $\cala$-modules and inherits…

Very recently, Bai [Linear Algebra Appl., 681:150-186, 2024 \& Appl. Math. Lett., 166:109510, 2025] studied some concrete structures, and obtained essential algebraic and computational properties of the one-dimensional, two-dimensional and…

We explore the N=1* theories compactified on a circle with twisted boundary conditions. The gauge algebra of these theories are the so-called twisted affine Lie algebra. We propose the exact superpotentials by guessing the sum of all…

A II$_1$ factor $M$ has the {\it stable single generation} ({\it SSG}) property if any amplification $M^t$, $t>0$, can be generated as a von Neumann algebra by a single element. We discuss a conjecture stating that if $M$ is SSG, then $M$…

We show that for a typical high rank arithmetic lattice $\Gamma$, there exist finite index subgroups $\Gamma_{1}$ and $\Gamma_{2}$ such that $\Gamma_{1} \not\simeq \Gamma_{2}$ while $\widehat{\Gamma_{1}} \simeq \widehat{\Gamma_{2}}$. But…

A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,v\in V(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for…

The aim of this article is to describe a class of *-algebras that allows to treat well-behaved algebras of unbounded operators independently of a representation. To this end, Archimedean ordered *-algebras (*-algebras whose real linear…

We extend the polynomial method of Chen--Garza-Vargas--Tropp--van Handel and Magee--Puder--van Handel for operator-norm bounds in random permutation models to the setting where torsion is present. The main new feature is that asymptotic…

An algebra $A$ is said to be directly finite if each left invertible element in the (conditional) unitization of $A$ is right invertible. We show that the reduced group ${\rm C}^\ast$-algebra of a unimodular group is directly finite,…

A well-known application of the dependent random choice asserts that any $n$-vertex graph $G$ with positive edge density contains a `rich' vertex subset $U$ of size $n^{1-o(1)}$ such that every pair of vertices in $U$ has at least…

In this note, we first work out some `bare hands' computations of the most elementary possible free products involving $\mathbb{C}^2 ~(=\mathbb{C} \oplus \mathbb{C} $) and $M_2 ~(= M_2(\mathbb{C}))$. Using these, we identify all free…

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…

Let $A$ be a finite-dimensional algebra over an algebraically closed field. We prove $A$ is a strongly derived unbounded algebra if and only if there exists an integer $m$, such that $C_m(\proj A)$, the category of all minimal projective…

Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…

Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…

We consider a Leibniz algebra ${\mathfrak L} = {\mathfrak I} \oplus {\mathfrak V}$ over an arbitrary base field $\mathbb{F}$, being ${\mathfrak I}$ the ideal generated by the products $[x,x], x \in {\mathfrak L}$. This ideal has a…