Related papers: The Complexity of Connectedness Relations on Polis…
For a compact Lie group G we show that if the representing spectrum for Borel cohomology generates its category of modules if G is connected. For a closed subgroup H of G we consider the map C^*(BG)--->C^*(BH) and establish the sense in…
Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of…
This paper begins the exploration of what we call measures of association between two irreducible complex projective varieties of the same dimension. The idea is to study from various points of view the minimal complexity of correspondences…
We summarize ideas and methods that apply to rigidity and connectivity percolation. These include: constraint counting concepts, exact calculations on diluted trees and numerical results on diluted lattices using matching algorithms. The…
We study loci of arcs on a smooth variety defined by order of contact with a fixed subscheme. Specifically, we establish a Nash-type correspondence showing that the irreducible components of these loci arise from (intersections of)…
Continual Lie algebras are infinite-dimensional generalizations of Lie algebras with discrete root system by considering continual root systems. In this paper we establish the general relation between chain complexes and continual Lie…
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
We show that all the standard distances from metric geometry and functional analysis, such as Gromov-Hausdorff distance, Banach-Mazur distance, Kadets distance, Lipschitz distance, Net distance, and Hausdorff-Lipschitz distance have all the…
In this paper we show an explicit relation between chains of torsion classes and weak stability conditions over an abelian category. In particular, up to a natural equivalence, they coincide. We investigate topological properties of the…
A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an…
This dissertation investigates the relative complexity between a continuum and its proper subcontinua, in particular, providing examples of atriodic n-od-like continua. Let X be a continuum and n be an integer greater than or equal to…
Measuring the importance of nodes in a network with a centrality measure is a core task in any network application. There are many measures available and it is speculated that many encode similar information. We give an explicit non-linear…
Cosmic connectivity and multiplicity, i.e. the number of filaments globally or locally connected to a given cluster is a natural probe of the growth of structure and in particular of the nature of dark energy. It is also a critical…
In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many…
We map the conformation space of a simple lattice polymer chain to a network, where (i) the vertices of the network have a one-to-one correspondence to the conformations of the chain, and (ii) a link between two vertices indicates the…
In important papers on cake-cutting -- one of the key areas in fair division and resource allocation -- the measure-theoretical fundamentals are not fully correctly given. It is not clear (i) which family of sets should be taken for the…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
Perhaps, it is not too far from the truth to say that, among the great concepts (as compactness, completeness, order, convexity) on which functional analysis is based, connectedness is relatively less popular, though this does not mean that…
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and…