Related papers: Ramanujan Complexes of Type $\tilde{A_d}$
A simplicial complex $\Delta$ is called flag if all minimal nonfaces of $\Delta$ have at most two elements. The following are proved: First, if $\Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $\Delta$ (i)…
High dimensional expanders is a vibrant emerging field of study. Nevertheless, the only known construction of bounded degree high dimensional expanders is based on Ramanujan complexes, whereas one dimensional bounded degree expanders are…
We introduce the multineighbor complex of a graph, which is a simplicial complex in which a simplex is a subset of the graph with a sufficient number of mutual neighbors. We investigate the asymptotic homological properties of such…
In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
We prove a kind of bilateral semi-terminating series related to Ramanujan-like series for negative powers of $\pi$, and conjecture a type of supercongruences associated to them. We support this conjecture by checking all the cases for many…
We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may…
Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…
In this paper we present experimental ways of evaluating Ramanujan`s quantities which as someone can see are related with algebraic numbers. The good thing with algebraic numbers is that can be found in a closed form, from there…
Kahale proved that linear sized sets in $d$-regular Ramanujan graphs have vertex expansion $\sim\frac{d}{2}$ and complemented this with construction of near-Ramanujan graphs with vertex expansion no better than $\frac{d}{2}$. However, the…
For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
We define two different simplicial complexes, the common divisor simplicial complex and the prime divisor simplicial complex, from a set of integers, and explore their similarities. We will define a map between the two simplicial complexes,…
The hypergeometric formulae designed by Ramanujan more than a century ago for efficient approximation of $\pi$, Archimedes' constant, remain an attractive object of arithmetic study. In this note we discuss some $q$-analogues of…
We give new nested radical equations of similar kind to Ramanujan's questions to the Indian Mathematical Society 100 years ago. While many have since considered these from the perspectives of the Notebooks of Ramanujan and from the theory…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
In this paper, we prove supercongruence relations for truncated $N$-tuple sums of basic hypergeometric series. As an application, we give double, triple, and quadruple sum analogs of some Ramanujan-type supercongruences.
In this paper we introduce a Cayley-type graph for group-subgroup pairs and present some elementary properties of such graphs, including connectedness, their degree and partition structure, and vertex-transitivity. We relate these…
Inspired by a Zudilin-Zhao's supercongruences pattern related to Ramanujan-like series for $1/\pi^k$, we conjecture a kind of $p$-adic expansions.
We show that the space $\tilde{A}_{d}(m,n)$ consisting of all real projective classes of $(n+1)$-tuples of real coefficients homogeneous polynomials of degree $d$ in $(m+1)$ variables, without common real roots except zero, has the same…