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

推荐订阅源

L
LangChain Blog
Recent Announcements
Recent Announcements
GbyAI
GbyAI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Azure Blog
Microsoft Azure Blog
N
Netflix TechBlog - Medium
人人都是产品经理
人人都是产品经理
MongoDB | Blog
MongoDB | Blog
D
DataBreaches.Net
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
WordPress大学
WordPress大学
U
Unit 42
腾讯CDC
D
Docker
The GitHub Blog
The GitHub Blog
阮一峰的网络日志
阮一峰的网络日志
Vercel News
Vercel News
I
InfoQ
Jina AI
Jina AI
爱范儿
爱范儿
宝玉的分享
宝玉的分享
博客园 - Franky
G
Google Developers Blog
P
Proofpoint News Feed

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}}$
The $α$-representation for the Tait coloring and for the ...
Eduard Lerner · 2025-03-18 · via math.CO updates on arXiv.org

Consider a finite field $\mathbb F_q$, $q=p^d$, where $p$ is an odd number. Let $M=(E,r)$ be a regular matroid; denote by ${\mathcal B}$ the family of its bases, $\bar s(M;α)=\sum_{B\in {\mathcal B}}\prod_{e\not\in B} α_e$, where ${α_e\in \mathbb F_q}$, $α_e\neq 0$. Let a subset $A\equiv A(α)$ in $E$ have the maximal cardinality and satisfy the condition $\bar s(M|A;α)\neq 0$, while ${r^*}(α)=|A|-r(E)$. Let us represent the value of the characteristic polynomial of the matroid $M$ at the point $q$ as the linear combination of Legendre symbols with respect to $\bar s(M|A;α)$, whose coefficients are modulo equal to $1/q^{r^*(α)/2}$. This representation generalizes the formula for a flow polynomial of a graph which was obtained by us earlier. The latter formula is an analog of the so-called $α$-representation of vacuum Feynman amplitudes in the case of a finite field, which has inspired the Kontsevich conjecture (1997). The $α$-representation technique is also applicable for expressing the number of Tait colorings for a cubic biconnected planar graph in terms of principal minors of the matrix of faces of this graph.