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

推荐订阅源

J
Java Code Geeks
Martin Fowler
Martin Fowler
B
Blog RSS Feed
D
DataBreaches.Net
L
LangChain Blog
月光博客
月光博客
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
V
Visual Studio Blog
美团技术团队
Jina AI
Jina AI
博客园 - 司徒正美
雷峰网
雷峰网
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
小众软件
小众软件
罗磊的独立博客
博客园_首页
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
A
About on SuperTechFans
Engineering at Meta
Engineering at Meta

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}}$
Bidirected graphs, integral quadratic forms and some Diop...
Jesús Arturo Jiménez González, Andrzej Mróz · 2023-04-25 · via math.CO updates on arXiv.org

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and determine all forms that appear in this way in two main results: first, among non-negative connected unit forms, precisely those of Dynkin type $\mathbb{A}$ or $\mathbb{D}$ are incidence forms; second, we give simple conditions on the coefficients of a non-negative connected non-unitary form to be an incidence form. We say that those non-unitary forms have Dynkin type $\mathbb{C}$, and justify such nomenclature by generalizing known classifications and properties of non-negative quadratic forms of Dynkin types $\mathbb{A}$ and $\mathbb{D}$ to the introduced type~$\mathbb{C}$. We also show that the graphical framework of an incidence form is an useful tool to visualize its arithmetical properties, to prove new facts and to perform efficient computations for integral quadratic forms and related problems in number theory, algebra and graph theory. For instance, in a third main result we relate the walks of a bidirected graph with the $0,1,2$-roots of the associated incidence form (and to the classical root systems in the positive case). Moreover, we prove the universality property for a large class of integral quadratic forms, provide computational methods to find solutions or to characterize the finiteness of the sets of solutions of various related Diophantine equations, show a variant of Whitney's theorem on line graphs using switching classes, and apply our techniques to give a conceptual and constructive proof of the non-negativity (and possible Dynkin types) of the Euler quadratic forms of a class of finite-dimensional gentle algebras.