Related papers: A note on $m$-factorizations of complete multigrap…

We study factorization and dilation properties of Markov maps between von Neumann algebras equipped with normal faithful states, i.e., completely positive unital maps which preserve the given states and also intertwine their automorphism…

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…

Denote by $\lambda K_v$ the complete graph of order $v$ with multiplicity $\lambda$. Let $\lambda K_v-\lambda K_w-\lambda K_u$ be the graph obtained from $\lambda K_v$ by the removal of the edges of two vertex disjoint complete…

We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…

The $\lambda$-perfect maps, a generalization of perfect maps (continuous closed maps with compact fibers) are presented. Using $P_\lambda$-spaces and the concept of $\lambda$-compactness some results regarding $\lambda$-perfect maps will be…

For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

In the last two decades new techniques emerged to construct valuations on an infinite division ring $D,$ given a normal subgroup $N\subseteq D$ of finite index. These techniques were based on the commuting graph of $D^{\times}/N$ in the…

In this paper, we compute universal minimal flows of groups of automorphisms of uncountable $\omega$-homogeneous graphs, $K_n$-free graphs, hypergraphs, partially ordered sets, and their extensions with an $\omega$-homogeneous ordering. We…

We give a construction that in many cases gives a simple way to construct infinite families of algebras that are not Morita equivalent, but are all derived equivalent to the same block algebra of a finite group, and apply it to some small…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Let $f$ be a monic quadratic polynomial over a finite field of odd characteristic. In 2012, Boston and Jones constructed a Markov process based on the post-critical orbit of $f$, and conjectured that its limiting distribution explains the…

Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…

We explore a family of invariants obtained from linking numbers. This is a family of Kauffman finite type invariants.

In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our method is to establish some graph structures on fractal squares to reveal the…