Search arXiv⌕ Search

arXiv · 2112.13766

The Probabilistic Zeta Function of a Finite Lattice

Abstract

We study Brown's definition of the probabilistic zeta function of a finite lattice as a generalization of that of a finite group. We propose a natural alternative or extension that may be better suited for non-atomistic lattices. The probabilistic zeta function admits a general Dirichlet series expression, which unlike for groups, need not be ordinary. We compute the function for several examples of finite lattices, establishing a connection with the Stirling numbers of the second kind in the case of the divisibility lattice. Furthermore, in the context of moving from groups to lattices, we are interested in lattices with probabilistic zeta function given by ordinary Dirichlet series. In this regard, we focus on partition lattices and $d$-divisible partition lattices. Using the prime number theorem, we show that the probabilistic zeta functions of the latter typically fail to be ordinary Dirichlet series.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Besfort Shala. 2023-04-24. The Probabilistic Zeta Function of a Finite Lattice. https://doi.org/10.1216/rmj.2024.54.1511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗