English
Related papers

Related papers: Lp expander Complexes

200 papers

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

Combinatorics · Mathematics 2018-10-12 Elie de Panafieu

After seeing how questions on the finer distribution of prime factorization -- considered inaccessible until recently -- reduce to bounding the norm of an operator defined on a graph describing factorization, we will show how to bound that…

Number Theory · Mathematics 2022-01-04 Harald Andrés Helfgott

In this paper, we obtain a $(p,\nu)$-extension of the Whittaker function $M_{\kappa,\mu}(z)$ by using the extended confluent hypergeometric function of the first kind $\Phi_{p,\nu}(b;c;z)$ introduced in Parmar et al. [J. Classical Anal. 11…

Classical Analysis and ODEs · Mathematics 2018-01-31 S A Dar , R B Paris

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

Combinatorics · Mathematics 2012-03-08 Nicolai Hähnle

We will use a discrete analogue of the classical \emph{Laplace} method to show that for infinitely many positive integers $n$, the main term of the asymptotic expansions of scaled confluent basic hypergeometric functions, including the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Ruiming Zhang

We prove that there exist infinite families of regular bipartite Ramanujan graphs of every degree bigger than 2. We do this by proving a variant of a conjecture of Bilu and Linial about the existence of good 2-lifts of every graph. We also…

Combinatorics · Mathematics 2014-03-04 Adam Marcus , Daniel A. Spielman , Nikhil Srivastava

The connection zeta function of a finite abstract simplicial complex G is defined as zeta_L(s)=sum_x 1/lambda_x^s, where lambda_x are the eigenvalues of the connection Laplacian L defined by L(x,y)=1 if x and y intersect and 0 else. (I) As…

Combinatorics · Mathematics 2018-01-16 Oliver Knill

The combinatorial Hopf algebra on building sets $BSet$ extends the chromatic Hopf algebra of simple graphs. The image of a building set under canonical morphism to quasi-symmetric functions is the chromatic symmetric function of the…

Combinatorics · Mathematics 2012-12-13 Vladimir Grujić , Tanja Stojadinović

We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…

Mathematical Physics · Physics 2015-06-05 Ram Band , Jonathan M. Harrison , Christopher H. Joyner

This is a survey on weight enumerators, zeta functions and Riemann hypothesis for linear and algebraic-geometry codes.

Information Theory · Computer Science 2018-07-17 Artur Elezi , Tony Shaska

A ($\kappa$,$\tau$)-regular set is a vertex subset S inducing a $\kappa$-regular subgraph such that every vertex out of S has $\tau$ neighbors in S. This article is an expository overview of the main results obtained for graphs with…

Combinatorics · Mathematics 2019-01-01 Domingos M. Cardoso

Ramanujan derived the well known divergent-sum of integers in more than one way. We generalise the informal method to higher powers of the Riemann zeta function through a study of the Eulerian numbers in particular. Within the context of…

Number Theory · Mathematics 2023-03-27 Patrick J. Burchell

In this article, we derive meromorphic continuation of multiple Lerch zeta functions by generalising an elegant identity of Ramanujan. Further, we describe the set of all possible singularities of these functions. Finally, for the multiple…

Number Theory · Mathematics 2017-06-20 Sanoli Gun , Biswajyoti Saha

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…

Combinatorics · Mathematics 2024-05-30 Geoffroy Caillat-Grenier

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

Combinatorics · Mathematics 2020-09-28 Jakob Hansen

We establish the quaternionic weighted zeta function of a graph and its Study determinant expressions. For a graph with quaternionic weights on arcs, we define a zeta function by using an infinite product which is regarded as the Euler…

Combinatorics · Mathematics 2015-09-28 Norio Konno , Hideo Mitsuhashi , Iwao Sato

In this paper we study spectral zeta functions associated to finite and infinite graphs. First we establish a meromorphic continuation of these functions under some general conditions. Then we study special values in the case of standard…

Spectral Theory · Mathematics 2019-09-05 Jérémy Dubout

Given an n-dimensional natural Hamiltonian L on a Riemannian or pseudo-Riemannian manifold, we call "extension" of L the n+1 dimensional Hamiltonian $H=\frac 12 p_u^2+\alpha(u)L+\beta(u)$ with new canonically conjugated coordinates…

Exactly Solvable and Integrable Systems · Physics 2015-06-17 Giovanni Rastelli

Extending constructions by Gabriel and Zisman, we develop a functorial framework for the cohomology and homology of simplicial sets with very general coefficient systems given by functors on simplex categories into abelian categories.…

K-Theory and Homology · Mathematics 2020-11-09 Imma Gálvez-Carrillo , Frank Neumann , Andrew Tonks

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

Combinatorics · Mathematics 2007-05-23 Alexander Burstein , Sergey Kitaev , Toufik Mansour
‹ Prev 1 4 5 6 7 8 10 Next ›