Peter Cameron, Thomas Prellberg, Dudley Stark
We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or identification by permutation of rows/columns are imposed. We find asymptotics and relationships for the number of matrices with $n$ ones in these classes as $n\to\infty$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the leading asymptotics for the number of matrices with $n$ ones as $n\to\infty$. We also give refined results for the asymptotic number of $i\times j$ incidence matrices with $n$ ones.
We identify a relationship between a random walk on a certain Euclidean lattice and incidence matrices of balanced incomplete block designs. We then compute the return probability of the random walk and use it to obtain the asymptotic number of BIBD incidence matrices (as the number of columns increases). Our strategy is similar in spirit to the one used by de Launey and Levin to count partial Hadamard matrices.
The incidence energy $\mathscr{IE}(G)$ of a graph $G$, defined as the sum of the singular values of the incidence matrix of a graph $G$, is a much studied quantity with well known applications in chemical physics. The Laplacian-energy-like invariant of $G$ is defined as the sum of square roots of the Laplacian eigenvalues. In this paper, we obtain the closed-form formulae expressing the incidence energy and the Laplacian-energy-like invariant of the Union Jack lattice. Moreover, the explicit asymptotic values of these quantities are calculated by utilizing the applications of analysis approach…
Asymptotic number of edge-colored regular graphs
本文推导了边着色正则图的渐近数量公式，并应用该结果计算了大随机k-正则图的c-边着色期望数量。
We define the $d$-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and outerplanar graphs. Fast algorithms for constructing the optimal $d$-defective incidence colorings of those graphs are presented.
Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above classes. In every construction we obtain a matrix N whose blocks are square (0,1) matrices such that N becomes the incidence matrix of a rectangular design. The method is the reverse of the well known tactical decomposition of the incidence matrix of a known design. Authors have already obtained some series of Group Divisible and Latin square designs using this…
We consider the structures of the plane-line and point-line incidence matrices of the projective space $\mathrm{PG}(3,q)$ connected with orbits of planes, points, and lines under the stabilizer group of the twisted cubic. In the literature, lines are partitioned into classes, each of which is a union of line orbits. In this paper, for all $q$, even and odd, we determine the incidence matrices connected with a family of orbits of the class named $\mathcal{O}_6$. This class contains lines external to the twisted cubic. The considered family include an essential part of all $\mathcal{O}_6$ orbits…
We obtain some asymptotic formulae (with power savings in their error terms) for the number of quadruples in the Cartesian product of an arbitrary set $A \subset \mathbf{R}$ and for the number of quintuplets in $A\times A$ for any subset $A$ of the prime field $\mathbf{F}_p$. Also, we obtain some applications of our results to incidence problems in $\mathbf{F}_p$.
We study the height of the delta peak at 0 in the spectrum of random tree incidence matrices. We show that the average fraction of the spectrum occupied by the eigenvalue 0 in a large random tree is asymptotic to 2x-1 = 0.1342865808195677459999... where x is the unique real root of x = exp(-x). For finite trees, we give a closed form, a generating function, and an asymptotic estimate for the sequence 1,0,3,8,135,1164,21035,.... of the total multiplicity of the eigenvalue 0 in the set of n^{n-2} tree incidence matrices of size n>0.
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
该研究引入图的顶点-团关联矩阵，推导图负特征值、负惯性指数及相关能量的界，推广无符号拉普拉斯矩阵等概念，并借此证明多类满足q(G)=2的图，建立了团划分、边团覆盖与图谱的关联。
On the asymptotic enumeration and limit shapes of monotone grid classes of permutations
本文提出了一种渐近计数排列单调网格类的方法，通过分析网格化排列及点的渐近分布，计算了连通单角类的排列数量，并确定了连通单调网格类的极限形状。
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number $g_n/n!$ (resp. $g_n$) of labelled (resp. unlabelled) graphs on $n$ vertices from a subcritical graph class ${G}=\cup_n {G_n}$ satisfies asymptotically the…
Triangles with one fixed side-length, a Furstenberg type problem, and incidences in finite vector spaces
本文利用有限域中点与刚体运动的关联界，建立固定边长三角形及高维单形全等类的尖锐存在条件，并统一证明已知最佳单形分布结果，同时研究刚体运动下的 Furstenberg 型问题。
We have for positive integers $n$, $k$ and finite field $\mathbb{F}_q$, $c(n,k,q)$, as the number of simultaneous similarity classes of $k$-tuples of commuting $n\times n$ matrices over the $\mathbb{F}_q$. In this paper, it has been shown that $c(n,k,q)$ as a function of $k$ for fixed $n$ and $q$ is asymptotically $q^{m(n)k}$, where $m(n) = \left[\frac{n^2}{4}\right] + 1$, which is the dimension of the maximal commutative subalgebra of $M_n(\mathbb{F}_q)$ (the algebra of $n\times n$ matrices over $\mathbb{F}_q$).
Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs classes based on singularity analysis of generating functions, which generalizes previously studied cases such as planar graphs and series-parallel graphs. We provide a general result for the asymptotic number of graphs in $\mathcal{G}$, based on the singularities of the exponential generating function associated to $\mathcal{T}$. We derive limit laws, which are e…
It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix of type II. Similarly, any ternary extended quadratic residue code contains the incidence matrix of a Hadamard 3-design associated with a Paley-Hadamard matrix of type I. If $q=5, 11, 17, 23$, then the full permutation automorphism group of $L(q)$ coincides with the full automorphism group of $D(q)$, and a similar result holds for the ternary extended quadr…
Further results on orbits and incidence matrices for the class $\mathcal{O}_6$ of lines external to the twisted cubic in $\mathrm{PG}(3,q)$
该研究针对射影空间$\u200b\mathrm{PG}(3,q)$中研究最少的扭三次曲线外部线类$\u200b\mathcal{O}_6$，提出其新轨道族，分析对应稳定子群与关联子矩阵，通过求解相关三次、四次方程解数完成推导。
The nonsingular real plane algebraic curves of given degree $d$ are considered either up to isotopy or up to deformation. The asymptotic behavior of the number $I_d$ of isotopy classes and the number $D_d$ of deformation classes are studied. It is shown, in particular, that $log I_d\asypt d^2$. Other related problems and their higher dimensional generalisations are discussed.
Asymptotic normality of pattern counts in conjugacy classes
该研究在温和条件下证明了共轭类中均匀随机置换的vincular模式计数的渐近正态性，同时证实经典模式计数的极限方差非退化，采用加权依赖图完成证明。
Asymptotics for moments of the minimal partition excludant in congruence classes
本文研究整数划分中频率小于给定数的最小正整数的矩，针对特定同余类建立渐近公式，并证明固定模数下各矩渐近相等。
The asymptotic number of equivalence classes of linear codes with given dimension
本文研究了给定长度和维数的线性码等价类的渐近数量，推导了三种等价概念下的显式渐近公式，并建立了与离散高斯分布的联系。
Asymptotic Theories of Classes Defined by Forbidden Homomorphisms
该研究聚焦同态禁止结构类的一阶几乎必然理论，解决了有向树禁止集类的理论描述问题，证明其均为ω-范畴，并得出有限有向图约束满足问题具一阶收敛性的独立价值结果。
The asymptotic estimation for two classes of generalized Fibonacci sub-sequences
本文利用初等方法，对广义Fibonacci序列的两类无穷级数倒数的渐近估计进行了研究，推广了Yuan等人2025年的结果。
We define a class of properties on random plane trees, which we call subtree additive properties, inspired by the combinatorics of certain biologically-interesting properties in a plane tree model of RNA secondary structure. The class of subtree additive properties includes the Wiener index and path length (total ladder distance and total ladder contact distance, respectively, in the biological context). We then investigate the asymptotic distribution of these subtree additive properties on a random plane tree distributed according to a Gibbs distribution arising from the Nearest Neighbor Ther…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。