Jianmin Ma
In this note, we determined the distance signatures of the incidence matrices of affine resolvable designs. This proves a conjecture by Kohei Yamada.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Bose proved the inequality $b\geq v+r-1$ for resolvable balanced incomplete block designs (RBIBDs) and Kageyama improved it for RBIBDs which are not affine resolvable. In this note we prove a new lower bound on the number of blocks $b$ that holds for all BIBDs. We further prove that for a significantly large number of BIBDs our bound is tighter than the bounds given by the inequalities of Bose and Kageyama.
We prove a theorem unifying three results from combinatorial homological and commutative algebra, characterizing the Koszul property for incidence algebras of posets and affine semigroup rings, and characterizing linear resolutions of squarefree monomial ideals. The characterization in the graded setting is via the Cohen-Macaulay property of certain posets or simplicial complexes, and in the more general nongraded setting, via the sequential Cohen-Macaulay property.
Resolvable Triple Arrays
本文提出了一种新的三数组构造方法，通过结合对称2设计与分解，生成非极值三数组，并引入无序三数组概念，证明了某些无限族的可解性与有限射影平面的关系。
Incidence Gain Graphs and Generalized Quadrangles
本文提出在关联几何的关联图上利用满足双射性质的增益函数构造广义四边形的方法，并在任意域上的仿射平面上给出了一族广义四边形的实例。
We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of incidences between points and $m$-flats in affine geometries over finite fields. First, we show an upper bound on the number of incidences between sufficiently large subsets of the points and blocks of a BIBD. Second, we show that a sufficiently large subset of the points of a BIBD determines many t-rich blocks. Third, we show that a sufficiently large subset …
A residual design ${\cal{D}}_B$ with respect to a block $B$ of a given design $\cal{D}$ is defined to be linearly embeddable over $GF(p)$ if the $p$-ranks of the incidence matrices of ${\cal{D}}_B$ and $\cal{D}$ differ by one. A sufficient condition for a residual design to be linearly embeddable is proved in terms of the minimum distance of the linear code spanned by the incidence matrix, and this condition is used to show that the residual designs of several known infinite classes of designs are linearly embeddable. A necessary condition for linear embeddability is proved for affine resolvab…
We determine the Smith normal forms of the incidence matrices of points and projective (r-1)-dimensional subspaces of PG(n,q) and of the incidence matrices of points and r-dimensional affine subspaces of AG(n,q) for all n, r, and arbitrary prime power q.
The purpose of this article is to further explore how the structure of the affine group can be used to deduce new incidence theorems, and to explore sum-product type applications of these incidence bounds, building on the recent work of Rudnev and Shkredov. We bound the energy of several systems of lines, in some cases obtaining a better energy bound than the corresponding bounds obtained by Rudnev and Shkredov by exploiting a connection with collinear quadruples. Our motivation for seeking to generalise and improve the incidence bound obtained by Rudnev and Shkredov comes from possible applic…
In this paper, we introduce an algebra $\mathcal{H}$ from a subspace lattice with respect to a fixed flag which contains its incidence algebra as a proper subalgebra. We then establish a relation between the algebra $\mathcal{H}$ and the quantum affine algebra $U_{q^{1/2}}(\widehat{\mathfrak{sl}}_2)$, where $q$ denotes the cardinality of the base field. It is an extension of the well-known relation between the incidence algebra of a subspace lattice and the quantum algebra $U_{q^{1/2}}(\mathfrak{sl}_2)$. We show that there exists an algebra homomorphism from $U_{q^{1/2}}(\widehat{\mathfrak{sl}…
Incidence Rank and Bounded Defect for Linear Hypergraphs with Cograph Line Graphs
本文研究线图为补图的线性超图，定义余维数秩并证明其非负性，在有限网完备化假设下给出有界亏格的显式分类，并利用Bruck与Metsch定理得到全局结构推论。
Inverse Theorems for Point-Sphere Incidences over Finite Fields
该研究在有限域上证明了点-球 incidences 的反向定理，揭示了近极值性与代数刚性的关系，并解决了有限域上定点距离和点积问题的结构问题。
In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence matrices turn out to be redundant, which means that their number of rows exceeds their rank. Such a feature is absent from random LDPC codes and is in general interesting for the efficiency of iterative decoding. The performance of some codes under iterative decoding is tested. Some of them turn out to perform better than regular Gallager codes having similar rate…
We study the localization number of incidence graphs of designs. In the localization game played on a graph, the cops attempt to determine the location of an invisible robber via distance probes. The localization number of a graph $G$, written $ζ(G)$, is the minimum number of cops needed to ensure the robber's capture. We present bounds on the localization number of incidence graphs of balanced incomplete block designs. Exact values of the localization number are given for the incidence graphs of projective and affine planes. Bounds are given for Steiner systems and for transversal designs.
A Method of Construction of Pairwise Additive Balanced Incomplete Block Designs
本文提出从ARSRGD设计及广义哈达玛矩阵构造成对可加BIB设计的新方法，结合广义哈达玛矩阵的已知结果得到含此前未知参数集的新无穷系列成对可加BIB设计。
We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection arrays for valency $5$, and the Cayley graphs among all distance-regular graphs with girth $3$ and valency $6$ or $7$. We obtain that the incidence graphs of Desarguesian affine planes minus a parallel class of lines are Cayley graphs. We show that the incidence graphs of the known generalized hexagons are not Cayley graphs, and neither are som…
A graph $Γ$ is $G$-symmetric if $G$ is a group of automorphisms of $Γ$ which is transitive on the set of ordered pairs of adjacent vertices of $Γ$. If $V(Γ)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such that for blocks $B, C \in {\cal B}$ adjacent in the quotient graph $Γ_{\cal B}$ of $Γ$ relative to ${\cal B}$, exactly one vertex of $B$ has no neighbour in $C$, then $Γ$ is called an almost multicover of $Γ_{\cal B}$. In this case an incidence structure with point set ${\cal B}$ arises naturally, and it is a $(G, 2)$-point-transitive and $G$-block-transitive 2-design if in addit…
This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear codes generated by the rows of these incidence matrix are subcodes of the extended codes of the 4-th order generalized Reed-Muller codes and they also hold 2-designs. Finally, we give the dimensions and lower bound of the minimum weights of these linear codes.
Affine groups as flag-transitive and point-primitive automorphism groups of symmetric designs
本文研究了容许旗传递且点本原仿射自同构群的对称设计，证明了当λ为素数时自同构群的结构，并给出了此类对称设计的完整分类。
Ollivier--Ricci Idleness Functions and Edge-Connectivity of Hypergraphs
该研究将图的边连通性与Lin-Lu-Yau曲率的关系推广到超图，证明了满足非负曲率的局部有限连通r-均匀线性超图的边连通性等于其最小关联度，且非线性超图中二者差距可任意大。
This paper considers three imprimitive distance-regular graphs with 486 vertices and diameter 4: the Koolen--Riebeek graph (which is bipartite), the Soicher graph (which is antipodal), and the incidence graph of a symmetric transversal design obtained from the affine geometry $\mathrm{AG}(5,3)$ (which is both). It is shown that each of these is preserved by the same rank-9 action of the group $3^5:(2\times M_{10})$, and the connection is explained using the ternary Golay code.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。