Related papers: Equivalences in diagrammatic sets

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…

We introduce two 2-categories which categorify the monodromic Hecke algebra. The first is algebraic in nature and generalizes Abe's theory of Soergel bimodules. The second is a diagrammatic category defined via generators and relations…

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

A reduction of properties (invariants) of compact sets of real numbers to properties of countable orders is presented here. Discussed here is also an embedding property of some compact sets that are called t$\mathbb R$-sets. Among others,…

Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…

We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define…

An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…

In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components…

We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…

In this paper we consider a random graph on which topological restrictions are imposed, such as constraints on the total number of edges, wedges, and triangles. We work in the dense regime, in which the number of edges per vertex scales…

The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…

We develop a general theory of (extended) inner autoequivalences of objects of any 2-category, generalizing the theory of isotropy groups to the 2-categorical setting. We show how dense subcategories let one compute isotropy in the presence…

We demonstrate equivalence between two definitions of lower finite highest weight categories. We also show that, in the presence of a duality, a lower finite highest weight structure on a category is unique. Finally, we give a new proof for…

In previous work, we showed that there are appropriate model category structures on the category of simplicial categories and on the category of Segal precategories, and that they are Quillen equivalent to one another and to Rezk's complete…

For a sequence of uniformly bounded, degenerate semigroups on a Hilbert space, we compare various types of convergences to a limit semigroup. Among others, we show that convergence of the semigroups, or of the resolvents of the generators,…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…