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

推荐订阅源

博客园 - 三生石上(FineUI控件)
J
Java Code Geeks
Apple Machine Learning Research
Apple Machine Learning Research
Jina AI
Jina AI
博客园_首页
C
Check Point Blog
小众软件
小众软件
博客园 - 叶小钗
Blog — PlanetScale
Blog — PlanetScale
Engineering at Meta
Engineering at Meta
美团技术团队
Martin Fowler
Martin Fowler
Vercel News
Vercel News
D
Docker
罗磊的独立博客
B
Blog RSS Feed
The Cloudflare Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 聂微东
Last Week in AI
Last Week in AI
T
Tailwind CSS Blog
雷峰网
雷峰网
博客园 - Franky

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}}$
Some results on the Ryser design conjecture
Tushar D. Parulekar, Sharad S. Sane · 2019-07-29 · via math.CO updates on arXiv.org

A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $λ$ points (and $λ< v$ is a fixed number) and there are at least two block sizes. A design $\mathcal{D}$ is called a symmetric design, if every point of $\mathcal{D}$ has the same replication number (or equivalently, all the blocks have the same size) and every two blocks intersect each other in $λ$ points. The only known construction of a Ryser design is via block complementation of a symmetric design. Such a Ryser design is called a Ryser design of Type-1. This is the ground for the Ryser-Woodall conjecture: "every Ryser design is of Type-1". This long standing conjecture has been shown to be valid in many situations. Let $\mathcal{D}$ denote a Ryser design of order $v$, index $λ$ and replication numbers $r_1,r_2$. Let $e_i$ denote the number of points of $\mathcal{D}$ with replication number $r_i$ (with $i = 1, 2$). Call $A$ small (respectively large) if $|A| < 2λ$ (respectively $|A| > 2λ$) and average if $|A|=2λ$. Let $D$ denote the integer $e_1 - r_2$ and let $ρ> 1$ denote the rational number $\dfrac{r_1-1}{r_2-1}$. Main results of the present article are the following. For every block $A$, $r_1 \geq |A| \geq r_2$ (this improves an earlier known inequality $|A| \geq r_2$). If there is no small block (respectively no large block) in $\mathcal{D}$, then $D\leq -1$ (respectively $D\geq 0$). With an extra assumption $e_2 > e_1$ an earlier known upper bound on $v$ is improved from a cubic to a quadratic in $λ$. It is also proved that if $v \leq λ^2+ λ+ 1$ and if $ρ$ equals $λ$ or $λ- 1$, then $\mathcal{D}$ is of Type-1. Finally a Ryser design with $ 2^n + 1$ points is shown to be of Type-1.