Related papers: Deitmar schemes, graphs and zeta functions
This paper establishes a combinatorial link between different approaches to constructing Whittaker functions on a metaplectic group over a non-archimedean local field. We prove a metaplectic analogue of Tokuyama's Theorem and give a crystal…
In this paper, we introduce the category of blueprints, which is a category of algebraic objects that include both commutative (semi)rings and commutative monoids. This generalization allows a simultaneous treatment of ideals resp.\…
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…
Let $\pi=\{V_1,\dots,V_r\}$ be an equitable partition of the vertex set of a directed graph (digraph) $X$. It is well known that the characteristic polynomial $\phi(X/\pi,x)$ of a quotient graph $X/\pi$ divides that of $X$, but the…
In earlier work we studied features of non-holomorphic modular functions associated with Feynman graphs for a conformal scalar field theory on a two-dimensional torus with zero external momenta at all vertices. Such functions, which we will…
We develop a discrete spectral framework for Dirichlet $L$-functions that reveals a combinatorial structure underlying their special values and connects this to their zeros. Our approach approximates the classical Dirichlet series by finite…
Curves over finite fields are of great importance in cryptography and coding theory. Through studying their zeta-functions, we would be able to find out vital arithmetic and geometric information about them and their Jacobians, including…
In this paper, we relate a beautiful theory by Lov\'asz with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensional generalization known as the Weisfeiler-Leman…
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…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…
We define smooth notions of concordance and sliceness for spatial graphs. We prove that sliceness of a spatial graph is equivalent to a condition on a set of linking numbers together with sliceness of a link associated to the graph. This…
Partial zeta functions of algebraic varieties over finite fields generalize the classical zeta function by allowing each variable to be defined over a possibly different extension field of a fixed finite field. Due to this extra variation…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
We elaborate notions of integration over the space of arcs factorized by the natural $C^*$-action and over the space of non-parametrized arcs (branches). There are offered two motivic versions of the zeta function of the classical monodromy…
Following and generalizing a construction by Kontsevich, we associate a zeta function to any matrix with entries in a ring of noncommutative Laurent polynomials with integer coefficients. We show that such a zeta function is an algebraic…
We describe the main building blocks of a generic automated package for the calculation of Feynman diagrams. These blocks include the generation and creation of a model file, the graph generation, the symbolic calculation at an intermediate…
An old result by Shearer relates the Lov\'asz Local Lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard core lattice gas on graphs. We use this…
In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function $\zeta(s)$ for all real $s$, $s>1$, in polynomial time and linear space on Turing machines in Ko-Friedman model. The algorithms is based on a…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…