English
Related papers

Related papers: Explicit construction of Ramanujan bigraphs

200 papers

Let $X$ denote a connected $(q+1)$-regular undirected graph of finite order $n$. The graph $X$ is called Ramanujan whenever $$ |\lambda|\leq 2q^{\frac{1}{2}} $$ for all nontrivial eigenvalues $\lambda$ of $X$. We consider the variant…

Combinatorics · Mathematics 2020-07-06 Hau-Wen Huang

Expander graphs have many interesting applications in communication networks and other areas, and thus these graphs have been extensively studied in theoretic computer sciences and in applied mathematics. In this paper, we use reversible…

Combinatorics · Mathematics 2013-07-02 Xiwang Cao

Let G be a connected semisimple group over a non-Archimedean local field. For every faithful, geometrically irreducible linear representation of G we define a compactification of the associated Bruhat-Tits building X(G). This yields a…

Algebraic Geometry · Mathematics 2007-05-23 Annette Werner

Let G be a semisimple quasi-split group defined over a global function field. We express the relative Tamagawa number of G in terms of local data including the number of types of special vertices in one orbit of the Bruhat-Tits building…

Algebraic Geometry · Mathematics 2014-09-03 Rony Bitan , Ralf Köhl

We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…

Group Theory · Mathematics 2023-05-29 Pierre-Emmanuel Caprace , Martin Kassabov

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

Combinatorics · Mathematics 2025-12-15 Chun-Hung Liu , David R. Wood

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…

Combinatorics · Mathematics 2024-10-15 Shishuo Fu , Haijun Li

The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if…

Discrete Mathematics · Computer Science 2018-01-16 Kristóf Bérczi , Satoru Iwata , Jun Kato , Yutaro Yamaguchi

Ramanujan listed several q-series identities in his lost notebook. The most well known q-series identities are the Rogers-Ramanujan type identities which are first discovered by Rogers and then rediscovered by Ramanujan. In this paper, we…

Number Theory · Mathematics 2025-07-15 Sabi Biswas , Nipen Saikia

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…

Group Theory · Mathematics 2015-11-25 Roghayeh Hafezieh

For fixed large genus, we construct families of complete immersed minimal surfaces in R3 with four ends and dihedral symmetries. The families exist for all large genus and at an appropriate scale degenerate to the plane.

Differential Geometry · Mathematics 2014-10-01 Stephen J. Kleene , Niels Martin Moller

For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…

Number Theory · Mathematics 2020-08-17 Nipen Saikia , Jubaraj Chetry

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…

General Mathematics · Mathematics 2014-06-25 Nikos Bagis

We construct new families of U_q(gl_n)-modules by continuation from finite dimensional representations. Each such module is associated with a combinatorial object - admissible set of relations defined in \cite{FRZ}. More precisely, we prove…

Representation Theory · Mathematics 2017-04-06 Vyacheslav Futorny , Luis Enrique Ramirez , Jian Zhang

In a recent paper G. Bhatnagar has given simple proofs of some of Ramanujan's continued fractions. In this note we show that some variants of these continued fractions are generating functions of q-Schroeder-like numbers.

History and Overview · Mathematics 2012-10-02 Johann Cigler

Motivated by a question of Bumagin and Wise, we construct a continuum of finitely generated, residually finite groups whose outer automorphism groups are pairwise non-isomorphic finitely generated, non-recursively-presentable groups. These…

Group Theory · Mathematics 2018-10-25 Alan D. Logan

We give a classification of all quasitriangular structures and ribbon elements of $\mathcal{D}(G)$ explicitly in terms of group homomorphisms and central subgroups. This can equivalently be interpreted as an explicit description of all…

Quantum Algebra · Mathematics 2017-08-23 Marc Keilberg

We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…

Combinatorics · Mathematics 2021-11-24 Timothy Sun