Related papers: Some simple theories from a Boolean algebra point …
We survey some recent results about the order structure of various kinds of ultrafilters. More precisely, we study Rudin-Keisler and Tukey reducibility in classes of selective, stable ordered-union, and P-point ultrafilters. Although these…
Let $\mathfrak{g}$ be a finite-dimensional complex simple Lie algebra and $r,m\ge 2$. The universal central extension of the superelliptic current algebra $\mathfrak{g}\otimes A$ is $\widehat{\mathfrak{g}\otimes A}\cong\mathfrak{g}\otimes A…
We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…
We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…
An \emph{$(n,k,t)$-graph} is a graph on $n$ vertices in which every set of $k$ vertices contains a clique on $t$ vertices. Tur\'an's Theorem, rephrased in terms of graph complements, states that the unique minimum $(n,k,2)$-graph is an…
Gabriel's Theorem, and the work of Bernstein, Gelfand and Ponomarev established a connection between the theory of quiver representations and the theory of simple Lie algebras. Lie superalgebras have been studied from many perspectives, and…
In a regression setup with deterministic design, we study the pure aggregation problem and introduce a natural extension from the Gaussian distribution to distributions in the exponential family. While this extension bears strong…
We study $\mathrm{exa}_k(n,F)$, the largest number of edges in an $n$-vertex graph $G$ that contains exactly $k$ copies of a given subgraph $F$. The case $k=0$ is the Tur\'an number $\mathrm{ex}(n,F)$ that is among the most studied…
We show that a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank has normal 2-rank at most two, which is a tameness free version of Borovik's original trichotomy theorem. This…
There has recently been much interest in the $C^*$-algebras of directed graphs. Here we consider product systems $E$ of directed graphs over semigroups and associated $C^*$-algebras $C^*(E)$ and $\mathcal{T}C^*(E)$ which generalise the…
For special universal $C^*$-algebras associated to $k$-semigraphs we present the universal representations of these algebras, prove a Cuntz--Krieger uniqueness theorem, and compute the $K$-theory. These $C^*$-algebras seem to be the most…
The paper presents a classification theorem for the class of flat connections with triangular (0,1)-components on a topologically trivial complex vector bundle over a compact Kahler manifold. As a consequence we obtain several results on…
The $k$-dimensional Weisfeiler-Leman ($k$-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applications in Babai's quasipolynomial time isomorphism…
For every natural number k we introduce the notion of k-th order convolution of functions on abelian groups. We study the group of convolution preserving automorphisms of function algebras in the limit. It turns out that such groups have…
Quivers (directed graphs) and species (a generalization of quivers) and their representations play a key role in many areas of mathematics including combinatorics, geometry, and algebra. Their importance is especially apparent in their…
A graph is inductive $k$-independent if there exists and ordering of its vertices $v_{1},...,v_{n}$ such that $\alpha(G[N(v_{i})\cap V_{i}])\leq k $ where $N(v_{i})$ is the neighborhood of $v_{i}$, $V_{i}=\{v_{i},...,v_{n}\}$ and $\alpha$…
Given a graph of C*-algebras, we prove a long exact sequence in KK-theory for both the maximal and the vertex-reduced fundamental C*-algebras in the presence of possibly non GNS-faithful conditional expectations. We deduce from it the…
The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…
In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order $n$ is attained by the pure cycling register rule, as conjectured by Golomb. We generalize this result to the tensor product of…
In this note, we formulate and prove branching rules of simple polynomial modules for the Lie superalgebra $\mathfrak{gl}(m|n)$. Our branching rules depend on the conjugacy class of the Borel subalgebra. A Gelfand-Tsetlin basis of a…