中文
相关论文

相关论文: Roman and Vatican Crossover Designs

200 篇论文

Scalable quantum computing is fundamentally bottlenecked not by qubit count or fabrication yield, but by a rigid temporal mismatch: macroscopic classical coordination latency ($\tau_c$) inevitably grows with system diameter, while…

量子物理 · 物理学 2026-05-14 Bo Fan , Renzhou Fang , Yuntao Zhang , Xiaolong Yuan , Dafa Zhao

By making use of the generalized concept of orthogonality in Latin squares, certain t-partite graphs have been constructed and a suggestion for a net work system and some applications have been made.

离散数学 · 计算机科学 2007-05-23 R. N. Mohan , Moon Ho Lee , Subhash Pokrel

Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…

信息论 · 计算机科学 2020-10-22 Avik Ranjan Adhikary , Yanghe Feng , Zhengchun Zhou , Pingzhi Fan

Scripting code may present maintenance problems in the long run. There is, then, the call for methodologies that make it possible to control the properties of programs written in dynamic languages in an automatic fashion. We introduce…

计算机科学中的逻辑 · 计算机科学 2015-03-18 Marcin Benke , Viviana Bono , Aleksy Schubert

A quantum Latin square of order $v$, QLS($v$), is a $v\times v$ array in which each of entries is a unit column vector from the Hilbert space $\mathbb{C}^{v}$, such that every row and column forms an orthonormal basis of $\mathbb{C}^{v}$.…

组合数学 · 数学 2025-08-05 Yajuan Zang , Meihui Zheng , Zihong Tian , Xiuling Shan

A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms. These objects are enumerated by the well-known Catalan numbers, and have been introduced with the aim of giving a common language to most of the structures…

离散数学 · 计算机科学 2010-11-17 Stefano Bilotta , Filippo Disanto , Renzo Pinzani , Simone Rinaldi

In 1974 Allan Cruse provided necessary and sufficient conditions to extend an $r\times s$ partial latin rectangle consisting of $t$ distinct symbols to a latin square of order $n$. Here we provide some generalizations and consequences of…

组合数学 · 数学 2011-08-10 Serge C. Ballif

Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a partition into disjoint colourings, we speak of a packing.…

组合数学 · 数学 2024-12-06 Stijn Cambie , Rimma Hämäläinen

A latin bitrade is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. Dr\'apal (\cite{Dr9}) showed that a latin bitrade is…

组合数学 · 数学 2008-03-08 Nicholas J. Cavenagh , Ales Drapal , Carlo Hamalainen

We analyze a supersymmetric system with four flat directions. We observe several interesting properties, such as the coexistence of the discrete and continuous spectrum in the same range of energies. We also solve numerically the classical…

高能物理 - 理论 · 物理学 2008-11-26 Piotr Korcyl

Computer experiments with both qualitative and quantitative input variables occur frequently in many scientific and engineering applications. How to choose input settings for such experiments is an important issue for accurate statistical…

统计方法学 · 统计学 2022-03-15 Feng Yang , C. Devon Lin , Yongdao Zhou , Yuanzhen He

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

组合数学 · 数学 2019-11-13 William J. Keith

This is a translation of Leonhard Euler's ``De quadratis magicis'' . It is E795 in the Enestrom index. This paper studies how to construct magic squares with certain numbers of cells, in particular 9, 16, 25 and 36. It considers some…

组合数学 · 数学 2007-05-23 Leonhard Euler

Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, $[k]$-Roman domination provides a unified framework that generalizes Roman, double…

组合数学 · 数学 2026-04-15 Simon Brezovnik , Janez Žerovnik

A Latin square of order $n$ with symbols $a_1,\ldots,a_n$ can be considered as a multiplication table for binary operation in the set $A=\{a_1,\ldots,a_n\}$. We prove that, if this operation is associative, then $A$ is a group.

历史与综述 · 数学 2022-09-01 Yury Kochetkov

Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subproblems. Canonical labeling of combinatorial objects…

数据结构与算法 · 计算机科学 2013-05-01 Hadi Katebi , Karem A. Sakallah , Igor L. Markov

A latin bitrade (T1, T2) is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. A genus may be associated to a latin bitrade…

组合数学 · 数学 2009-09-16 Ales Drapal , Carlo Hamalainen , Dan Rosendorf

A crossover trial is an efficient trial design when there is no carry-over effect. To reduce the impact of the biological carry-over effect, a washout period is often designed. However, the carry-over effect remains an outstanding concern…

应用统计 · 统计学 2024-03-06 Danni Shi , Ting Ye

This is a companion note to the paper "Almost all Steiner triple systems have perfect matchings (arXiv:1611.02246). That paper contains several general lemmas about random Steiner triple systems; in this note we record analogues of these…

组合数学 · 数学 2021-10-01 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to…

组合数学 · 数学 2011-02-08 J. H. Dinitz , P. R. J. Ostergard , D. R. Stinson