中文
相关论文

相关论文: Tight quasi-symmetric designs

200 篇论文

This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…

组合数学 · 数学 2025-08-27 Sho Suda , Zili Xu , Wei-Hsuan Yu

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

环与代数 · 数学 2013-01-01 Gábor Czédli

We characterize the SDP designs that give rise to four-weight spin models with two values. We prove that the only such designs are the symplectic SDP designs. The proof involves analysis of cardinalities of intersections of four blocks.

组合数学 · 数学 2007-05-23 Carl Bracken , Gary McGuire

Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information…

统计理论 · 数学 2009-09-29 J. P. Morgan , Brian H. Reck

Quasicrystals provide a fascinating class of materials with intriguing properties. Despite a strong potential for numerous technical applications, the conditions under which quasicrystals form are still poorly understood. Currently, it is…

材料科学 · 物理学 2010-05-13 J. Mikhael , M. Schmiedeberg , S. Rausch , J. Roth , H. Stark , C. Bechinger

The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…

几何拓扑 · 数学 2021-04-26 Sebastian Baader , Pierre Dehornoy , Livio Liechti

We prove that a certain binary linear code associated with the incidence matrix of a quasi-symmetric 2-(37,9,8) design with intersection numbers 1 and 3 must be contained in an extremal doubly even self-dual code of length 40. Using the…

组合数学 · 数学 2017-10-20 Masaaki Harada , Akihiro Munemasa , Vladimir D. Tonchev

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'atal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, this…

度量几何 · 数学 2022-09-22 Gabriela Araujo-Pardo , Martín Matamala , José Zamora

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6.

组合数学 · 数学 2016-09-20 Yuefeng Yang , Benjian Lv , Kaishun Wang

In this paper we investigate the spectrum of super-simple 2-$(v,5,1)$ directed designs (or simply super-simple 2-$(v,5,1)$DDs) and also the size of their smallest defining sets. We show that for all $v\equiv1,5\ ({\rm mod}\ 10)$ except…

组合数学 · 数学 2012-07-10 Nasrin Soltankhah , Farzane Amirzade

In this paper we study quasi-symmetric conjugations of $C^2$ weakly order-preserving circle maps with a flat interval. Under the assumption that the maps have the same rotation number of bounded type and that bounded geometry holds we…

动力系统 · 数学 2019-02-20 Liviana Palmisano

We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from…

组合数学 · 数学 2011-05-10 Melissa Keranen , Melanie Laffin

We formulate N-fold supersymmetry in quantum mechanical systems with reflection operators. As in the cases of other systems, they possess the two significant characters of N-fold supersymmetry, namely, almost isospectrality and weak…

数学物理 · 物理学 2012-08-15 Toshiaki Tanaka

We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…

组合数学 · 数学 2022-01-04 Sung-Yell Song , Theodore Tranel

A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…

组合数学 · 数学 2013-06-11 Arman Fazeli , Shachar Lovett , Alexander Vardy

In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t,…

组合数学 · 数学 2024-01-23 R. Julian R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

A $2-(v,k,\lambda)$ directed design (or simply a $2-(v,k,\lambda)DD$) is super-simple if its underlying $2-(v,k,2\lambda)BIBD$ is super-simple, that is, any two blocks of the $BIBD$ intersect in at most two points. A $2-(v,k,\lambda)DD$ is…

组合数学 · 数学 2012-06-26 Nasrin Soltankhah , Farzane Amirzade

We consider nonconforming methods for symmetric elliptic problems and characterize their quasi-optimality in terms of suitable notions of stability and consistency. The quasi-optimality constant is determined and the possible impact of…

数值分析 · 数学 2017-10-11 Andreas Veeser , Pietro Zanotti

We study tight projective 2-designs in three different settings. In the complex setting, Zauner's conjecture predicts the existence of a tight projective 2-design in every dimension. Pandey, Paulsen, Prakash, and Rahaman recently proposed…

信息论 · 计算机科学 2021-02-15 Joseph W. Iverson , Emily J. King , Dustin G. Mixon

In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Further, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit…

组合数学 · 数学 2023-08-03 Dean Crnković , Doris Dumičić Danilović , Ana Šumberac , Andrea Švob