惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 聂微东
博客园 - 【当耐特】
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
C
Check Point Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
美团技术团队
WordPress大学
WordPress大学
Last Week in AI
Last Week in AI
Y
Y Combinator Blog
IT之家
IT之家
T
Tailwind CSS Blog
月光博客
月光博客
Vercel News
Vercel News
V
V2EX
Engineering at Meta
Engineering at Meta
B
Blog
Stack Overflow Blog
Stack Overflow Blog
A
About on SuperTechFans
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
腾讯CDC
I
InfoQ

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
An Elementary Dyadic Riemann Hypothesis
Oliver Knill · 2018-01-15 · via math.CO updates on arXiv.org

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 a consequence of the spectral formula chi(G)=sum_x (-1)^dim(x) = p(G)-n(G), where p(G) is the number of positive eigenvalues and n(G) is the number of negative eigenvalues of L, both the Euler characteristic chi(G)=zeta(0)-2 i zeta'(0)/pi as well as determinant det(L)=e^zeta'(0)/pi can be written in terms of zeta. (II) As a consequence of the generalized Cauchy-Binet formula for the coefficients of the characteristic polynomials of a product of matrices we show that for every one-dimensional simplicial complex G, the functional equation zeta(s)=zeta(-s) holds, where zeta(s) is the Zeta function of the positive definite squared connection operator L^2 of G. Equivalently, the spectrum sigma of the integer matrix L^2 for a 1-dimensional complex always satisfies the symmetry sigma = 1/sigma and the characteristic polynomial of L^2 is palindromic. The functional equation extends to products of one-dimensional complexes. (III) Explicit expressions for the spectrum of circular connection Laplacian lead to an explicit entire zeta function in the Barycentric limit. The situation is simpler than in the Hodge Laplacian H=D^2 case where no functional equation was available. In the connection Laplacian case, the limiting zeta function is a generalized hypergeometric function which for an integer s is given by an elliptic integral over the real elliptic curve w^2=(1+z)(1-z)(z^2-4z-1), which has the analytic involutive symmetry (z,w) to (1/z,w/z^2).