Related papers: Certain topological methods for computing digital …
We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of…
We announce new methods for using prismatic cohomology to compute the K-groups of $\mathbb{Z}/p^n$ and related rings. We use computer algebra methods to compute these K-groups through a large range in specific cases and also obtain explicit…
We consider a sub-class of the $f$-divergences satisfying a stronger convexity property, which we refer to as strongly convex, or $\kappa$-convex divergences. We derive new and old relationships, based on convexity arguments, between…
We prove that the topological complexity $\mathrm{TC}(\pi)$ equals $\mathrm{cd}(\pi\times\pi)$ for certain toral relatively hyperbolic groups $\pi$.
We investigate the Ulrich complexity of certain examples of Brauer--Severi varieties, twisted flags and involution varieties and establish lower and upper bounds. Furthermore, we relate Ulrich complexity to the categorical representability…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and…
Complex prediction models such as deep learning are the output from fitting machine learning, neural networks, or AI models to a set of training data. These are now standard tools in science. A key challenge with the current generation of…
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
There are different ways to define similarity for grouping similar texts into clusters, as the concept of similarity may depend on the purpose of the task. For instance, in topic extraction similar texts mean those within the same semantic…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
The representation of complex systems as networks is inappropriate for the study of certain problems. We show several examples of social, biological, ecological and technological systems where the use of complex networks gives very limited…
By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times…
We introduce Clapp-Puppe type generalized Lusternik-Schnirelmann (co)category in a Quillen model category. We establish some of their basic properties and give various characterizations of them. As the first application of these…
We consider special subclasses of the class of Lindel\"of Sigma-spaces obtained by imposing restrictions on the weight of the elements of compact covers that admit countable networks: A space $X$ is in the class $L\Sigma(\leq\kappa)$ if it…
Topological phases of matter are often described using auxiliary systems in one extra dimension. I review the one-dimensional cluster state--the simplest quantum state with Symmetry-Protected Topological (SPT) order--as a toy model of…
We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,\{(S^{k_i},\star)\})$, e.g. robot arms with restrictions on the possible combinations of…
Living systems exhibit complex yet organized behavior on multiple spatiotemporal scales. To investigate the nature of multiscale coordination in living systems, one needs a meaningful and systematic way to quantify the complex dynamics, a…
The study of irreducible higher-order interactions has become a core topic of study in complex systems. Two of the most well-developed frameworks, topological data analysis and multivariate information theory, aim to provide formal tools…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…