相关论文: On a Dehn-Sommerville functional for simplicial co…

We consider a certain linear combination $S(\mathbf{s},\mathbf{y};I;\Delta)$ of zeta-functions of root systems, where $\Delta$ is a root system of rank $r$ and $I\subset\{1,2,\ldots,r\}$. Showing two different expressions of…

For a graph $G$ with $n$ vertices, let $\nu(G)$ and $A(G)$ denote the matching number and adjacency matrix of $G$, respectively. The permanental polynomial of $G$ is defined as $\pi(G,x)={\rm per}(Ix-A(G))$. The permanental nullity of $G$,…

Let G be the group of points of a quasi-split reductive algebraic group over a local field F. It follows from the local Langlands conjectures that to every non-trivial additive character of F and every representation of the Langlands dual…

We define a Weil-\'etale complex with compact support for duals (in the sense of the Bloch dualizing cycles complex $\mathbb{Z}^c$) of a large class of $\mathbb{Z}$-constructible sheaves on an integral $1$-dimensional proper arithmetic…

Let $\Phi$ be an irreducible (possibly noncrystallographic) root system of rank $l$ of type $P$. For the corresponding cluster complex $\Delta(P)$, which is known as pure $(l-1)$-dimensional simplicial complex, we define the generating…

We introduce a ``non-orientable'' variation of Serre's definition of a graph, which we call an abstract isogeny graph. These objects capture the combinatorics of the graphs $G(p,\ell,H)$, the $\ell$-isogeny graphs of supersingular elliptic…

We prove that the $\gamma$-vector of the barycentric subdivision of a simplicial sphere is the $f$-vector of a balanced simplicial complex. The combinatorial basis for this work is the study of certain refinements of Eulerian numbers used…

The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf…

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…

Let De_n be the simplicial complex of squarefree positive integers less than or equal to n ordered by divisibility. It is known that the asymptotic rate of growth of its Euler characteristic (the Mertens function) is closely related to deep…

A relative simplicial complex is a collection of sets of the form $\Delta \setminus \Gamma$, where $\Gamma \subset \Delta$ are simplicial complexes. Relative complexes played key roles in recent advances in algebraic, geometric, and…

A finite abstract simplicial complex G defines a matrix L, where L(x,y)=1 if two simplicies x,y in G intersect and where L(x,y)=0 if they don't. This matrix is always unimodular so that the inverse g of L has integer entries g(x,y). In…

Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…

Let $R$ be a finite ring with unity, $\psi: R \to \mathbb{C}^\times$ be an additive character of $R$, and \( \chi_0 \) be the principal multiplicative character ($i.e.$, $\chi_0(x) = 1 \quad \text{for all } x \in R^\times$), then the Gauss…

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…

Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…

The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…

Let X be a topological Hausdorff space together with a continuous action of a finite group G. Let R be the ring of integers of a number field F. Let E be a G-sheaf of flat R-modules over X and let $\Phi$ be a G-stable paracompactifying…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…