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

推荐订阅源

博客园_首页
Y
Y Combinator Blog
Engineering at Meta
Engineering at Meta
D
Docker
GbyAI
GbyAI
aimingoo的专栏
aimingoo的专栏
大猫的无限游戏
大猫的无限游戏
腾讯CDC
P
Proofpoint News Feed
A
About on SuperTechFans
WordPress大学
WordPress大学
Stack Overflow Blog
Stack Overflow Blog
Google DeepMind News
Google DeepMind News
C
Check Point Blog
Microsoft Security Blog
Microsoft Security Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
L
LangChain Blog
MyScale Blog
MyScale Blog
博客园 - 三生石上(FineUI控件)
Hugging Face - Blog
Hugging Face - Blog
Microsoft Azure Blog
Microsoft Azure Blog
N
Netflix TechBlog - Medium
G
Google Developers Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻

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}}$
A note on domination in intersecting linear systems
Adrián Vázquez-Ávila · 2018-06-06 · via math.CO updates on arXiv.org

A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a family of subsets on a ground finite set $P$ such that $|l\cap l^\prime|\leq 1$, for every $l,l^\prime \in \mathcal{L}$. The elements of $P$ and $\mathcal{L}$ are called points and lines, respectively, and the linear system is called intersecting if any pair of lines intersect in exactly one point. A subset $D$ of points of a linear system $(P,\mathcal{L})$ is a dominating set of $(P,\mathcal{L})$ if for every $u\in P\setminus D$ there exists $v\in D$ such that $u,v\in l$, for some $l\in\mathcal{L}$. The cardinality of a minimum dominating set of a linear system $(P,\mathcal{L})$ is called domination number of $(P,\mathcal{L})$, denoted by $γ(P,\mathcal{L})$. On the other hand, a subset $R$ of lines of a linear system $(P,\mathcal{L})$ is a 2-packing if any three elements of $R$ have not a common point (are triplewise disjoint). The cardinality of a maximum 2-packing of a linear system $(P,\mathcal{L})$ is called 2-packing number of $(P,\mathcal{L})$, denoted by $ν_2(P,\mathcal{L})$. It is know for intersecting linear systems $(P,\mathcal{L})$ of rank $r$ it satisfies $γ(P,\mathcal{L})\leq r-1$. In this note we prove, if $q$ is an even prime power and $(P,\mathcal{L})$ is an intersecting linear system of rank $q+2$ satisfying $γ(P,\mathcal{L})=q+1$, then this linear system can be constructed from a spanning $(q+1)$-uniform intersecting linear subsystem $(P^\prime,\mathcal{L}^\prime)$ of the projective plane of order $q$ satisfying $τ(P^\prime,\mathcal{L}^\prime)=ν_2(P^\prime,\mathcal{L}^\prime)-1=q+1$.