Related papers: Reduction of Simplicial Complex by Relation and Do…
We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…
Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to find a subset of k vertices such that the sum of the edge weights in the corresponding subgraph is maximized. The problem is known to be NP-hard, and is also very…
For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…
We develop a version of controlled algebra for simplicial rings. This generalizes the methods which lead to successful proofs of the algebraic K- theory isomorphism conjecture (Farrell-Jones Conjecture) for a large class of groups. This is…
A new method to determine the low-energy couplings of the $\Delta S=1$ weak Hamiltonian is presented. It relies on a matching of the topological poles in $1/m^2$ of three-point correlators of two pseudoscalar densities and a four-fermion…
In this paper, two new stochastic algorithms for calculating parametric derivatives of the solution to the Smoluchowski coagulation equation are presented. It is assumed that the coagulation kernel is dependent on these parameters. The new…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…
We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…
We translate the operations of polarization and depolarization from monomial ideals in a polynomial ring to abstract simplicial complexes. As a result, we explicitly describe the relation between the Koszul simplicial complex of a monomial…
The hierarchical matrix framework partitions matrices into subblocks that are either small or of low numerical rank, enabling linear storage complexity and efficient matrix-vector multiplication. This work focuses on the $H^2$-matrix format…
Reduction algebras (also known as generalized Mickelsson algebras, Zhelobenko algebras, or transvector algebras) are well-studied associative algebras appearing in the representation theory of Lie algebras. In the 1990s, Zhelobenko noted…
We study the question of realisability of iterated higher Whitehead products with a given form of nested brackets by simplicial complexes, using the notion of the moment-angle complex $Z_K$. Namely, we say that a simplicial complex $K$…
In this paper the authors provide a complete answer to Donkin's Tilting Module Conjecture for all rank $2$ semisimple algebraic groups and $\text{SL}_{4}(k)$ where $k$ is an algebraically closed field of characteristic $p>0$. In the…
This article uses relative symplectic cohomology, recently studied by the second author, to understand rigidity phenomena for compact subsets of symplectic manifolds. As an application, we consider a symplectic crossings divisor in a…
In this paper, we investigate the question of how one can recover the homology of a simplicial complex $X$ equipped with a regular action of a finite group $G$ from the structure of its quotient space $X/G.$ Specifically, we describe a…
The purpose of this note is to point out that simplicial methods and the well-known Dold-Kan construction in simplicial homotopy theory can be fruitfully applied to convert link homology theories into homotopy theories. Dold and Kan prove…
Spatial relations between objects in an image have proved useful for structural object recognition. Structural constraints can act as regularization in neural network training, improving generalization capability with small datasets.…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
This survey paper introduces to a technique called Torsion Subcomplex Reduction (TSR) for computing torsion in the cohomology of discrete groups acting on suitable cell complexes. TSR enables one to skip machine computations on cell…