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

推荐订阅源

Y
Y Combinator Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
V2EX
博客园 - 三生石上(FineUI控件)
Hugging Face - Blog
Hugging Face - Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
罗磊的独立博客
博客园_首页
量子位
雷峰网
雷峰网
GbyAI
GbyAI
小众软件
小众软件
酷 壳 – CoolShell
酷 壳 – CoolShell
D
DataBreaches.Net
H
Hackread – Cybersecurity News, Data Breaches, AI and More
The Cloudflare Blog
IT之家
IT之家
WordPress大学
WordPress大学
人人都是产品经理
人人都是产品经理
Apple Machine Learning Research
Apple Machine Learning Research
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}}$
Symmetrical 2-extensions of the 3-dimensional grid. I
Kirill Kostousov · 2019-12-18 · via math.CO updates on arXiv.org

For a positive integer $d$, a connected graph $Γ$ is a symmetrical 2-extension of the $d$-dimensional grid $Λ^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $Γ$ and its imprimitivity system $σ$ with blocks of order 2 such that there exists an isomorphism $\varphi$ of the quotient graph $Γ/σ$ onto $Λ^d$. The tuple $(Γ, G, σ, \varphi)$ with specified components is called a realization of the symmetrical 2-extension $Γ$ of the grid $Λ^{d}$. Two realizations $(Γ_1, G_1,$ $σ_1, \varphi_1)$ and $(Γ_2, G_2, σ_2, \varphi_2)$ are called equivalent if there exists an isomorphism of the graph $Γ_1$ onto $Γ_2$ which maps $σ_1$ onto $σ_2$. V. Trofimov proved that, up to equivalence, there are only finitely many realizations of symmetrical $2$-extensions of $Λ^{d}$ for each positive integer $d$. E. Konovalchik and K. Kostousov found all, up to equivalence, realizations of symmetrical 2-extensions of the grid $Λ^2$. In this work we found all, up to equivalence, realizations $(Γ, G, σ, \varphi)$ of symmetrical 2-extensions of the grid $Λ^3$ for which only the trivial automorphism of $Γ$ preserves all blocks of $σ$ (we prove that there are 5573 such realizations, and that among corresponding graphs $Γ$ there are 5350 pairwise non-isomorphic).