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

推荐订阅源

D
DataBreaches.Net
IT之家
IT之家
博客园_首页
博客园 - 【当耐特】
V
V2EX
Apple Machine Learning Research
Apple Machine Learning Research
G
Google Developers Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
GbyAI
GbyAI
腾讯CDC
H
Hackread – Cybersecurity News, Data Breaches, AI and More
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
I
InfoQ
H
Help Net Security
T
Tailwind CSS Blog
B
Blog RSS Feed
Martin Fowler
Martin Fowler
人人都是产品经理
人人都是产品经理
The Cloudflare Blog
博客园 - 叶小钗
雷峰网
雷峰网
量子位

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}}$
Generalized pentagonal geometries -- II
Anthony D. Forbes, Carrie G. Rutherford · 2021-11-27 · via math.CO updates on arXiv.org

A generalized pentagonal geometry PENT($k$,$r$,$w$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point, $x$, the set of points not collinear with $x$ forms the point set of a Steiner system $S(2,k,w)$ whose blocks are lines of the geometry. If $w = k$, the structure is called a pentagonal geometry and denoted by PENT($k$,$r$). The deficiency graph of a PENT($k$,$r$,$w$) has as its vertices the points of the geometry, and there is an edge between $x$ and $y$ precisely when $x$ and $y$ are not collinear. Our primary objective is to investigate generalized pentagonal geometries PENT($k$,$r$,$w$) where the deficiency graph has girth 4. We describe some construction methods, including a procedure that preserves deficiency graph connectedness, and we prove a number of theorems regarding the existence spectra for $k = 3$ and various values of $w$. In addition, we present some new PENT(4,$r$) (including PENT(4,25)) and PENT(5,$r$) with connected deficiency graphs. Consequently, we prove that there exist pentagonal geometries PENT($k$,$r$) with deficiency graphs of girth at least 5 for $r \ge 13$, $r$ congruent to 1 modulo 4 when $k = 4$, and for $r \ge 200000$, $r$ congruent to 0 or 1 modulo 5 when $k = 5$. We conclude with a discussion of appropriately defined identifying codes for pentagonal geometries.