中文
相关论文

相关论文: Roman and Vatican Crossover Designs

200 篇论文

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

组合数学 · 数学 2020-07-29 Matthew Kwan

We develop a new method for constructing "good" designs for computer experiments. The method derives its power from its basic structure that builds large designs using small designs. We specialize the method for the construction of…

统计理论 · 数学 2010-10-05 C. Devon Lin , Derek Bingham , Randy R. Sitter , Boxin Tang

A classical question in combinatorics is the following:\ given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of \textbf{$\epsilon$-dense partial Latin squares}:\ partial…

组合数学 · 数学 2013-06-04 Padraic Bartlett

This article studies the benefits of using spatially randomized experimental designs which partition the experimental area into distinct, non-overlapping units with treatments assigned randomly. Such designs offer improved policy evaluation…

统计理论 · 数学 2025-11-18 Ying Yang , Chengchun Shi , Fang Yao , Shouyang Wang , Hongtu Zhu

Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy conjectured that every $n\times n$ Latin square has a `cycle-free' partial transversal of size $n-2$. We confirm this conjecture in a strong sense for almost all Latin squares, by showing that as $n…

组合数学 · 数学 2022-04-12 Stephen Gould , Tom Kelly

Quantitative assessment of the uncertainties tainting the results of computer simulations is nowadays a major topic of interest in both industrial and scientific communities. One of the key issues in such studies is to get information about…

统计理论 · 数学 2023-12-05 Guillaume Damblin , Mathieu Couplet , Bertrand Iooss

We show that the sets of $d$-dimensional Latin hypercubes over a non-empty set $X$, with $d$ running over the positive integers, determine an operad which is isomorphic to a sub-operad of the endomorphism operad of $X$. We generalise this…

组合数学 · 数学 2025-08-06 Markus Linckelmann

The main thrust of the article is to provide interesting example, useful for students of using bitwise operations in the programming languages C ++ and Java. As an example, we describe an algorithm for obtaining a Latin square of arbitrary…

其他计算机科学 · 计算机科学 2016-07-11 Krasimir Yordzhev

Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439-452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392-1397]) have become popular in computer experiments, numerical integration, stochastic optimization and…

统计理论 · 数学 2014-09-24 Xu He , Peter Z. G. Qian

The d-dimensional Catalan numbers form a well-known sequence of numbers which count balanced bracket expressions over an alphabet of size d. In this paper, we introduce and study what we call d-dimensional prime Catalan numbers, a sequence…

计算几何 · 计算机科学 2016-02-29 Manuel Wettstein

An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…

组合数学 · 数学 2017-01-18 Matthew Kwan , Benny Sudakov

Given an integer partition $P = (h_1h_2\dots h_k)$ of $n$, a realization of $P$ is a latin square with disjoint subsquares of orders $h_1,h_2,\dots,h_k$. Most known results restrict either $k$ or the number of different integers in $P$.…

组合数学 · 数学 2025-10-02 Tara Kemp , James G. Lefevre

Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, as it allows to establish polynomial-delay enumeration…

计算复杂性 · 计算机科学 2023-02-23 Henning Fernau , Kevin Mann

Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…

组合数学 · 数学 2015-02-20 Diane Donovan , Benjamin Haaland , David J. Nott

A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. Based on this representation, we apply a uniform method to prove the M. Hall's,…

组合数学 · 数学 2022-08-18 Béla Jónás

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

一般拓扑 · 数学 2023-12-01 Takanobu Aoyama

We prove the existence of quadratic relations between periods of meromorphic flat bundles on complex manifolds with poles along a divisor with normal crossings under the assumption of "goodness". In dimension one, for which goodness is…

代数几何 · 数学 2023-06-02 Javier Fresán , Claude Sabbah , Jeng-Daw Yu

Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no translational periods even though it retains some regularity of…

动力系统 · 数学 2025-12-16 Edmund Harriss , Henna Koivusalo , James J. Walton

Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design…

统计方法学 · 统计学 2025-06-06 Xu He , Junpeng Gong , Zhaohui Li

It has been argued for many years that models used to analyze data from crossover designs are not appropriate when simple carryover effects are assumed. Furthermore, a statistical model that could estimate complex carry-over effects in…

统计方法学 · 统计学 2025-08-22 N. A. Cruz , K. Mylona , O. O. Melo