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

推荐订阅源

WordPress大学
WordPress大学
大猫的无限游戏
大猫的无限游戏
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 叶小钗
月光博客
月光博客
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
人人都是产品经理
人人都是产品经理
阮一峰的网络日志
阮一峰的网络日志
罗磊的独立博客
IT之家
IT之家
美团技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Hugging Face - Blog
Hugging Face - Blog
博客园_首页
S
SegmentFault 最新的问题
宝玉的分享
宝玉的分享
博客园 - Franky
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Jina AI
Jina AI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
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}}$
Flag-transitive $4$-designs and $PSL(2,q)$ groups
Huili Dong · 2019-08-02 · via math.CO updates on arXiv.org

This paper considers flag-transitive $4$-$(q+1,k,λ)$ designs with $λ\geq5$ and $q+1>k>4$. Let the automorphism group of a design $\cal D$ be a simple group $G=PSL(2,q)$. Depend on the fact that the setwise stabilizer $G_B$ must be one of twelve kinds of subgroups, up to isomorphism we get the following two results. (i) If $10\geq λ\geq 5$, then except $(G,G_x,G_B,k,λ)=(PSL(2,761),{E_{761}}\rtimes {C_{380}},S_4,24,7)$ or $(PSL(2,512),{E_{512}}\rtimes {C_{511}},{D_{18}},18,8)$ undecided, $\cal D$ is a $4$-$(24,8,5)$, $4$-$(9,8,5)$, $4$-$(8,6,6)$, $4$-$(10,9,6)$, $4$-$(9,6,10)$, $4$-$(9,7,10)$, $4$-$(12,11,8)$ or $4$-$(14,13,10)$ design with $G_B=D_8$, ${E_8}\rtimes {C_7}$, $D_6$, ${E_9}\rtimes {C_4}$, $PSL(2,2)$, $D_{14}$, ${E_{11}}\rtimes {C_{5}}$ or ${E_{13}}\rtimes {C_6}$ respectively. (ii) If $λ>10$, ${G_B}=A_4$, $S_4$, $A_5$, $PGL(2,q_0)$($g>1$ even) or $PSL(2,q_0)$, where ${q_0}^g=q$, then there is no such design.