arXiv 2205.032112022-05math.CO

On certain classes of rectangular designs

Mithilesh Kumar Singh, Shyam Saurabh

英文摘要：

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 method. Tactical decomposable designs are of great interest because of their connections with automorphisms of designs, see Bekar et al. (1982). The rectangular designs constructed here are of statistical as well as combinatorial interest.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

关于矩形板上霸气的更新

An update on domineering on rectangular boards

Domestic是一种组合游戏，在两个玩家之间的矩形网格的子集上进行。每个棋盘位置都可以根据双方球员的最佳表现分为四个结果类别之一。在这篇文章中，我们回顾了以前的工作，建立了矩形板的几个维度的结果类，并限制了几个更多的结果类。

2013-05-15cs.GTmath.CO

The minimum stretch spanning tree problem for typical graphs

With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The problem has been proved to be NP-hard and fixed-parameter polynomial algorithms have been obtained for some special classes of graphs. In this paper, we concentrate on the optimality characterizations for typical classes of graphs. We determine the exact optimality representations for Petersen graph, the complete k-partite graphs, split graphs, generalized con…

2017-12-10math.CO

矩形性

Rectangularity

我们以某种方式引入了与拉丁方条件最大不同的数组条件，以及代数、图和$0,1$ -矩阵的一些其他条件。我们证明这些本质上是相同的结构，概括了Knuth在1970年提出的类似模型集合。我们找到的方法，这些结构可以更具体，有关现有的调查，然后表明，他们也是非常普遍的，群胚满足不平凡的方程。介绍了一些施工方法，并就这些施工如何保护某些结构进行了一些说明。最后，我们调查到什么程度的部分数组满足我们的条件和部分拉丁方重叠。

2011-08-08math.CO

某些近矩形剖分的Kronecker系数

Kronecker Coefficients For Some Near-Rectangular Partitions

我们给出公式计算克罗内克系数发生在$s_μ*s_ν$的扩展，其中$μ$和$ν$是近矩形，并有最小的部分等于1或2。特别地，我们研究了$s_{(n,n-1,1)}*s_{(n,n)}$、$s_{(n-1,n-1,1)}*s_{(n,n-1)}$、$s_{(n-1,n-1,2)}*s_{(n,n)}$、$s_{(n-1,n-1,1,1)}*s_{(n,n)}$和$s_{(n,n,1)}*s_{(n,n,1)}$。我们的方法依赖于操纵的对称函数和对称群的表示论之间的相互作用，主要采用皮耶里规则和一个有用的身份Littlewood。作为这些公式的后果，我们还推导出一个表达式，列举了某些标准的杨tableaux有界的高度，在Motzkin和Catalan数。

2014-03-21math.CO

A spanning union of cycles in rectangular grid graphs, thick grid cylinders and Moebius strips

Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles, the so-called 2-factors, in these graphs (as a generalizations of HCs). For all the three types of graphs from the title and for any integer $m \geq 2$ we propose an algorithm for obtaining a specially designed (transfer) digraph ${\cal D}^*_m$. The problem of enumeration of 2-factors is reduced to the problem of enumerating oriented walks in this digraph. Co…

2021-12-08math.CO

Fundamental invariants of tensors, Latin hypercubes, and rectangular Kronecker coefficients

We study polynomial SL-invariants of tensors, mainly focusing on fundamental invariants which are of smallest degrees. In particular, we prove that certain 3-dimensional analogue of the Alon--Tarsi conjecture on Latin cubes considered previously by Bürgisser and Ikenmeyer, implies positivity of (generalized) Kronecker coefficients at rectangular partitions and as a result provides values for degree sequences of fundamental invariants.

2023-01-23math.ACmath.COmath.RT

更多相关论文收起更多论文

有向重图的某些等价类的Enumeration（0 ~ 5个结点，每个结点有2个入弧和2个出弧）

An Enumeration of Certain Equivalence Classes of Directed Multigraphs Having 0 to 5 Nodes with Each Node Having 2 Incoming and 2 Outgoing Arcs

给出了具有0到5个节点的有向重图的某些等价类的枚举，每个节点具有2个传入弧和2个传出弧。

2000-08-03math.CO

某些类（几乎）正则图中的独立集

Independent sets in certain classes of (almost) regular graphs

我们列举了几类正则图和几乎正则图的独立集，并计算了相应的生成函数。我们还注意到这些图和其他组合对象之间的关系，并在某些情况下，构造相应的双射。

2003-10-23math.CO

某些图类的覆盖数运算

Operations on Covering Numbers of Certain Graph Classes

图与其补图的色数和与积的界称为Nordhaus-Gaddum不等式。本文研究了有补图的独立数运算。我们还提供了一个新的某些图形类的特征。

2015-06-10math.CO

From Dyck paths to standard Young tableaux

We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we introduce a special class of labeled Dyck paths of semilength $n$ that is shown to be in bijection with the set of all SYT with $n$ boxes. In addition, we present bijections from certain classes of Motzkin paths to SYT. As a natural framework for some of our bijections, we introduce a class of set partitions which in some sense is dual to the known class of…

2020-03-05math.CO

Rainbow independent sets in certain classes of graphs

For a given class $\mathcal{C}$ of graphs and given integers $m \leq n$, let $f_\mathcal{C}(n,m)$ be the minimal number $k$ such that every $k$ independent $n$-sets in any graph belonging to $\mathcal{C}$ have a (possibly partial) rainbow independent $m$-set. Motivated by known results on the finiteness and actual value of $f_\mathcal{C}(n,m)$ when $\mathcal{C}$ is the class of line graphs of graphs, we study this function for various other classes.

2019-09-28math.CO

一类$T_0$ -超图的Enumeration

Enumeration of Certain Classes of $T_0$-hypergraphs

一个超图是$T_0$ -超图，如果对于超图的每两个不同的顶点，存在一条包含其中一个顶点而不包含另一个顶点的边。给出了某些类$T_0$ -超图的计数的一般方法。$T_0$ -这里考虑的超图是通过它们自身满足的性质和与它们相关联的对偶超图满足的性质来挑选出来的。虽然在所谓的有序超图的情况下，“成为$T_0$ -超图”的性质被简化为相应矩阵的“具有不同列”的性质，但是将这个性质与我们在这里考虑的一些性质相结合，有时会给出不那么容易枚举的超图类。枚举一些这样获得的类的问题仍然没有解决。特别注意的是，致力于枚举不同类别的覆盖和连通超图。

2014-11-15math.CO

Singular nonsymmetric Jack polynomials for some rectangular tableaux

In the intersection of the theories of nonsymmetric Jack polynomials in $N$ variables and representations of the symmetric groups $\mathcal{S}_{N}$ one finds the singular polynomials. For certain values of the parameter $κ$ there are Jack polynomials which span an irreducible $\mathcal{S}_{N}$-module and are annihilated by the Dunkl operators. The $\mathcal{S}_{N}$-module is labeled by a partition of $N$, called the isotype of the polynomials. In this paper the Jack polynomials are of the vector-valued type, that is, elements of the tensor product of the scalar polynomials with the span of rev…

2020-03-03math.COmath.RT

置换上α-行列式的可积性

Averages of alpha-determinants over permutations

我们表明，一定的加权平均数的α-行列式的$kn$由$kn$矩阵的形式$A\otimes1_{1,k}$，Kronecker产品的$kn$由$n$矩阵$A$和$1$由$k$所有一个矩阵$1_{1,k}$，在置换的$kn$字母被减少到$k$ -花环行列式的$A$直到常数。该常数由杨氏图$(k^n)$的修正内容多项式精确给出。作为推论，我们给出了对称群上的某些函数在Young子群的左右平移下不变的行列式公式，特别是任意权的矩形的Kostka数的值.这个推论推广了Stanley关于矩形的对称群的不可约特征标公式。

2014-03-14math.COmath.RT

关于某些图类的平衡性

On the balanceability of some graph classes

Instituto de Matemáticas, UNAM（墨西哥国立自治大学数学研究所）

本文研究了图类的平衡性，通过新的充分条件，全面刻画了矩形网格、三角网格及特定的循环图的平衡性特征。

2020-11-17cs.DMmath.CO

某些具有势的颤动的突变类作为导出的等价类

Mutation classes of certain quivers with potentials as derived equivalence classes

我们刻画了标记有边无穿孔定向曲面的性质，所有的雅可比代数的箭图与潜在的三角剖分是等价的。这些曲面要么是具有b个边界分量且每个分量上有一个标记点的亏格g曲面，要么是边界上有4个或5个点的圆盘。我们证明了对于每个这样的标记曲面，突变类中的所有箭图具有相同数量的箭头，并且相应的Jacobian代数构成了有限维代数的完全导出等价类，其成员由Brenner-Butler倾斜序列连接。此外，我们为每个类提供了明确的抖动。我们还考虑了1,1个例外的有限突变箭图类中的10个（不包括X_7），它们不是由标记曲面的三角剖分产生的，并且证明了这类中的所有有限维雅可比代数（为了适当地选择位势）只对箭图类E_6^（1，1）和X_6是等价的。

2011-02-20math.COmath.RT