Related papers: A note on uniquely embeddable 2-factors
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
The Connes Embedding Problem (CEP) asks whether every separable II_1 factor embeds into an ultrapower of the hyperfinite II_1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II_1 von…
The cyclic graph of a group $G$ is the graph whose vertices are the nonidentity elements of $G$ and whose edges connect distinct elements $x$ and $y$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. We obtain information about…
For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…
In this article we describe properties of the 2-functor from the 2-category of comonads to the 2-category of functors that sends a comonad to its forgetful functor. This allows us to describe contexts where algebras over a monad are…
We study a simple, self-dual, rational, and $C_2$-cofinite vertex operator algebra of CFT-type whose simple current modules are graded by $\mathbb{Z}_{2k}$. Based on those simple current modules, a vertex operator algebra associated with a…
The power graph of a group $G$ is a simple and undirected graph with vertex set $G$ and two distinct vertices are adjacent if one is a power of the other. In this article, we characterize (non-cyclic) finite groups of prime exponent and…
Given a pair of dynamical systems we consider a pair of commuting von Neumann factors of type 11_1. The construction is a generalization of classical von Neumann-Murrey and grouppoid construction. It gives a natural examples of factors with…
We construct automorphisms of $\mathbb{C}^2$ with a cycle of escaping Fatou components, on which there are exactly two limit functions, both of rank 1. On each such Fatou component, the limit sets for these limit functions are two disjoint…
We define the phrase `category enriched in an fc-multicategory' and explore some examples. An fc-multicategory is a very general kind of 2-dimensional structure, special cases of which are double categories, bicategories, monoidal…
In the case of two-dimensional cyclic quotient singularities, we classify all one-parameter toric deformations in terms of certain Minkowski decompositions. In particular, we describe to which components each such deformation maps, show how…
A graph in which every connected induced subgraph has a disconnected complement is called a cograph. Such graphs are precisely the graphs that do not have the 4-vertex path as an induced subgraph. We define a $2$-cograph to be a graph in…
We construct a group measure space II$_1$ factor that has two non-conjugate Cartan subalgebras. We show that the fundamental group of the II$_1$ factor is trivial, while the fundamental group of the equivalence relation associated with the…
In this note we determine the finite groups that can be written as the union of any three irredundant/distinct proper subgroups. The finite groups that can uniquely be written as the union of three proper subgroups are also characterized.
In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies.
We study collections of additive categories $\mathcal{M}(G)$, indexed by finite groups $G$ and related by induction and restriction in a way that categorifies usual Mackey functors. We call them `Mackey 2-functors'. We provide a large…
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ with $2n$ vertices is asymptotically $c_g n^{5(g-1)/2-1}\gamma^{2n}(2n)!$, where $\gamma$…
We prove that tangent cones to 2-dimensional calibrated cycles are unique. Using this result we prove a rate of convergence for the mass of the blow-up of a calibrated integral 2-cycle towards the limiting density. With the same techniques,…
Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and…