Related papers: Higher analogs of simplicial and combinatorial com…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
Inflation of a simplicial complex $K$ is a construction well known in combinatorial topology. It replaces each vertex $i$ of $K$ with a finite number $n_i$ of its copies, and each simplex $\{i_0,\ldots,i_k\}$ with $n_{i_0}n_{i_1}\cdots…
In this paper we study plus-one generated arrangements of conics and lines in the complex projective plane with simple singularities. We provide several degree-wise classification results that allow us to construct explicit examples of such…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
In this paper, we define and prove basic properties of complement polyhedral product spaces, dual complexes and polyhedral product complexes. Then we compute the universal algebra of polyhedral product complexes under certain split…
We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…
We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
In the last years complex networks tools contributed to provide insights on the structure of research, through the study of collaboration, citation and co-occurrence networks. The network approach focuses on pairwise relationships, often…
This is a complete classification of the complex forms of quaternionic symmetric spaces
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…
A measure of complexity based on a probabilistic description of physical systems is proposed. This measure incorporates the main features of the intuitive notion of such a magnitude. It can be applied to many physical situations and to…
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…
We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes…
We introduce a new `geometric realization' of an (abstract) simplicial complex, inspired by probability theory. This space (and its completion) is a metric space, which has the right (weak) homotopy type, and which can be compared with the…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.
A new kind of numbers called Hyper Space Complex Numbers and its algebras are defined and proved. It is with good properties as the classic Complex Numbers, such as expressed in coordinates, triangular and exponent forms and following the…
The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a…
As an alternative to Kripke models, simplicial complexes are a versatile semantic primitive on which to interpret epistemic logic. Given a set of vertices, a simplicial complex is a downward closed set of subsets, called simplexes, of the…
We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…