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

推荐订阅源

J
Java Code Geeks
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Blog — PlanetScale
Blog — PlanetScale
G
Google Developers Blog
Microsoft Security Blog
Microsoft Security Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
腾讯CDC
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Jina AI
Jina AI
雷峰网
雷峰网
T
Tailwind CSS Blog
爱范儿
爱范儿
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
酷 壳 – CoolShell
酷 壳 – CoolShell
大猫的无限游戏
大猫的无限游戏
月光博客
月光博客
博客园 - 司徒正美
I
InfoQ
Engineering at Meta
Engineering at Meta
Vercel News
Vercel News
小众软件
小众软件
U
Unit 42
Google DeepMind News
Google DeepMind News
D
DataBreaches.Net

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}}$
Energized simplicial complexes
Oliver Knill · 2019-08-19 · via math.CO updates on arXiv.org

For a simplicial complex with n sets, let W^-(x) be the set of sets in G contained in x and W^+(x) the set of sets in G containing x. An integer-valued function h on G defines for every A subset G an energy E[A]=sum_x in A h(x). The function energizes the geometry similarly as divisors do in the continuum, where the Riemann-Roch quantity chi(G)+deg(D) plays the role of the energy. Define the n times n matrices L=L^--(x,y)=E[W^-(x) cap W^-(y)] and L^++(x,y) = E[W^+(x) cap W^+(y)]. With the notation S(x,y)=1_n omega(x) =delta(x,y) (-1)dim(x) and str(A)=tr(SA) define g=S L^++ S. The results are: det(L)=det(g) = prod_x in G h(x) and E[G] = sum_x,y g(x,y) and E[G]=str(g). The number of positive eigenvalues of g is equal to the number of positive energy values of h. In special cases, more is true: A) If h(x) in -1, 1}, the matrices L=L^--,L^++ are unimodular and L^-1 = g, even if G is a set of sets. B) In the constant energy h(x)=1 case, L and g are isospectral, positive definite matrices in SL(n,Z). For any set of sets G we get so isospectral multi-graphs defined by adjacency matrices L^++ or L^-- which have identical spectral or Ihara zeta function. The positive definiteness holds for positive divisors in general. C) In the topological case h(x)=omega(x), the energy E[G]=str(L) = str(g) = sum_x,y g(x,y)=chi(G) is the Euler characteristic of G and phi(G)=prod_x omega(x), a product identity which holds for arbitrary set of sets. D) For h(x)=t^|x| with some parameter t we have E[H]=1-f_H(t) with f_H(t)=1+f_0 t + cdots + f_d t^d+1 for the f-vector of H and L(x,y) = (1-f_W^-(x) cap W^-(y)(t)) and g(x,y)=omega(x) omega(y) (1-f_W^+(x) cap W^+(y)(t)). Now, the inverse of g is g^-1(x,y) = 1-f_W^-(x) cap W^-(y)(t)/t^dim(x cap y) and E[G] = 1-f_G(t)=sum_x,y g(x,y).