Related papers: Rank Selection and Depth Conditions for Balanced S…
For a simplicial complex X and a field K, let h_i(X)=\dim \tilde{H}_i(X;K). It is shown that if X,Y are complexes on the same vertex set, then for all k h_{k-1}(X\cap Y) \leq \sum_{\sigma \in Y} \sum_{i+j=k} h_{i-1}(X[\sigma])\cdot…
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong…
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
In a recent paper we introduced a much weaker and easy to verify structure than a model category, which we called a "weak fibration category". We further showed that a small weak fibration category can be "completed" into a full model…
In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…
This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…
Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…
We introduce topological conditions on a broad class of functionals that ensure that the persistent homology modules of their associated sublevel set filtration admit persistence diagrams, which, in particular, implies that they satisfy…
We associate with any simplicial complex $\K$ and any integer $m$ a system of linear equations and inequalities. If $\K$ has a simplicial embedding in $\R^m$ then the system has an integer solution. This result extends the work of I. Novik…
A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…
Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group){Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional…
We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the…
Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain…
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\:f^{\ast}=\min \{\,f(x):x\in K\,\}$ on a compact basic semi-algebraic set $K\subset\R^n$. This hierarchy combines some advantages…
We define a notion of depth for an inclusion of multimatrix algebras B < A based on a comparison of powers of the induction-restriction table M (and its transpose matrix). This notion of depth coincides with the depth from [Kadison, 2008].…
The presence of non-convexity in smooth optimization problems arising from deep learning have sparked new smoothness conditions in the literature and corresponding convergence analyses. We discuss these smoothness conditions, order them,…
We prove a complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally…