Related papers: Artin-Ihara L-functions for hypergraphs

Coloring the arcs of biregular graphs was introduced with possible applications to industrial chemistry, molecular biology, cellular neuroscience, etc. Here, we deal with arc coloring in some non-bipartite graphs. In fact, for…

Using a recent result of Bartels and Lueck (arXiv:0901.0442) we deduce that the Farrell-Jones Fibered Isomorphism conjecture in L-theory is true for any group which contains a finite index strongly poly-free normal subgroup, in particular,…

We study the Hilbert function and the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is a Cohen-Macaulay bipartite graph.

Let $F$ be a totally real field and let $E/F$ be a CM quadratic extension. We construct a $p$-adic $L$-function attached to Hida families for the group ${\rm GL}_{2/F}\times {\rm Res}_{E/F}{\rm GL}_{1}$. It is characterised by an exact…

We study Artin kernels, i.e. kernels of discrete characters of right-angled Artin groups, and we show that they decompose as graphs of groups in a way that can be explicitly computed from the underlying graph. When the underlying graph is…

For graphs $H_1$ and $H_2$, if we glue them by identifying a given pair of vertices $u \in V(H_1)$ and $v \in V(H_2)$, what is the extremal number of the resulting graph $H_1^u \odot H_2^v$? In this paper, we study this problem and show…

Inspired by connections described in a recent paper by Mark L. Lewis, between the common divisor graph $\Ga(X)$ and the prime vertex graph $\Delta(X)$, for a set $X$ of positive integers, we define the bipartite divisor graph $B(X)$, and…

In this paper, we investigate the Bartholdi zeta function on a connected simple digraph with $n_V$ vertices and $n_E$ edges. We derive a functional equation for the Bartholdi zeta function $\zeta_G(q,u)$ on a regular graph $G$ with respect…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

An edge-coloring of a hypergraph is {\em spanning} if every vertex sees every color used in the coloring. In this paper, we prove that for $k \geq 2r \geq 6$, in any spanning $k$-coloring of the edges of a complete $r$-partite $r$-uniform…

Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…

This paper investigates a new family of special functions referred to as hypergeometric zeta functions. Derived from the integral representation of the classical Riemann zeta function, hypergeometric zeta functions exhibit many properties…

We introduce $H$-chromatic symmetric functions, $X_{G}^{H}$, which use the $H$-coloring of a graph $G$ to define a generalization of Stanley's chromatic symmetric functions. We say two graphs $G_1$ and $G_2$ are $H$-chromatically equivalent…

For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ is paired with a $2$-edge-colouring…

Our objective in this series of two articles, of which the present article is the first, is to give a Perrin-Riou-style construction of $p$-adic $L$-functions (of Bella\"iche and Stevens) over the eigencurve. As the first ingredient, we…

We are studing Galois actions on fundamental groups. Using towers of coverings we construct measures on the products of finite copies of Z_p. Using these measures we can calculate coefficients of Galois representations. In the simplest case…

In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…

We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…

Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A…

Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…