Related papers: How to construct a flag complex with a given face …
Two $k$-uniform hypergraphs are said to be cospectral (E-cospectral), if their adjacency tensors have the same characteristic polynomial (E-characteristic polynomial). A $k$-uniform hypergraph $H$ is said to be determined by its spectrum,…
We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
The goal of this paper is to study the link between the topology of the degenerate flag varieties and combinatorics of the Dellac configurations. We define three new classes of algebraic varieties closely related to the degenerate flag…
The notion of a flag kernel on a homogeneous group is exteded to distributions of arbitrary multidimensional order. It is shown that under natural restrictions on order the operation of convolution admits an extension to thus generalised…
We construct covariant $q$-deformed holomorphic structures for all finitely-generated relative Hopf modules over the irreducible quantum flag manifolds endowed with their Heckenberger--Kolb calculi. In the classical limit these reduce to…
We propose a systematic method to produce potentially good recursive towers over finite fields. The graph point of view, so as some magma and sage computations are used in this process. We also establish some theoretical functional…
A method to construct fractal surfaces by recurrent fractal curves is provided. First we construct fractal interpolation curves using a recurrent iterated functions system(RIFS) with function scaling factors and estimate their box-counting…
We discuss various ensembles of homogeneous complex networks and a Monte-Carlo method of generating graphs from these ensembles. The method is quite general and can be applied to simulate micro-canonical, canonical or grand-canonical…
We construct a Parseval frame with $n+1$ vectors in $\R^n$ that contains a given vector. We also provide a characterization of unit-norm frames that can be scaled to a Parseval frame.
We show that one can use model categories to construct rational orthogonal calculus. That is, given a continuous functor from vector spaces to based spaces one can construct a tower of approximations to this functor depending only on the…
Consider a flag variety $Fl$ over an algebraically closed field, and a subvariety $V$ whose cycle class is a multiplicity-free sum of Schubert cycles. We show that $V$ is arithmetically normal and Cohen-Macaulay, in the projective embedding…
Topological methods have emerged as valuable tools for analyzing the structural properties of directed graphs, particularly connectome data in computational neuroscience. This paper investigates the construction of topological spaces from…
We present a combinatorial procedure (based on the W-graph of the Coxeter group) which shows that the characters of many intersection cohomology complexes on low rank complex flag varieties with coefficients in an arbitrary field are given…
Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…
We establish an explicit combinatorial/homological characterization of supports for linear degenerations of flag varieties. For such purpose, we introduce the concept of an excessive multisegment. It provides a new class of combinatorial…
We compute the coherent cohomology of the structure sheaf of complex periplectic Grassmannians. In particular, we show that it can be decomposed as a tensor product of the singular cohomology ring of a Grassmannian for either the symplectic…
We prove a reformulation of the multiplicity upper bound conjecture and use that reformulation to prove it for three-dimensional simplicial complexes and homology manifolds with many vertices. We provide necessary conditions for a…
The main invariant to study the combinatorics of a simplicial complex $K$ is the associated face ring or Stanley-Reisner algebra. Reisner respectively Stanley explained in which sense Cohen-Macaulay and Gorenstein properties of the face…
An emerging solution for explaining Transformer-based models is to use vector-based analysis on how the representations are formed. However, providing a faithful vector-based explanation for a multi-layer model could be challenging in three…