Results 31 to 40 of about 10,083 (180)
Clique decompositions of multipartite graphs and completion of Latin squares [PDF]
, 2017 Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one.
Barber, Ben +4 more
core +4 more sources
Low-Density Parity-Check Codes From Transversal Designs With Improved Stopping Set Distributions [PDF]
, 2013 This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the level of Latin
Er Gruner, Michael Huber, Student Member
core +1 more source
On Weighted-Sum Orthogonal Latin Squares and Secret Sharing
IACR Cryptology ePrint Archive, 2023 Latin squares are a classical and well-studied topic of discrete mathematics, and recently Takeuti and Adachi (IACR ePrint, 2023) proposed (2 , n ) -threshold secret sharing based on mutually orthogonal Latin squares (MOLS). Hence efficient constructions
Koji Nuida, T. Adachi
semanticscholar +1 more source
On seven mutually orthogonal Latin squares
Discrete Mathematics, 1977 AbstractLet N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is shown that N(n)⩾7 for n > 4922.
openaire +1 more source
Three mutually orthogonal Latin squares
Journal of Combinatorial Theory, Series A, 1972 AbstractIn a famous paper [3], Bose, Shrikhande, and Parker proved the existence of a pair of orthogonal Latin squares of order v for all v ≠ 2,6. In the present paper it is shown that there exist three mutually orthogonal Latin squares for all v ≡ 0,1 (mod 4). This result will be needed in several future papers on the covering of pairs by quadruples.
openaire +1 more source
Discrete phase-space approach to mutually orthogonal Latin squares
, 2014 We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions.
de Guise, Hubert +3 more
core +1 more source
Maximal sets of mutually orthogonal Latin squares
Discrete Mathematics, 1999 The authors present some new constructions for maximal sets of mutually orthogonal Latin squares. As an application, they provide examples for 24 previously open cases in the table by \textit{A. B. Evans} in [The CRC handbook of combinatorial designs, eds. C. J. Colbourn and J. H.
David A. Drake +2 more
openaire +1 more source
Tournament Design in Doubles Pickleball
International Journal of Racket Sports ScienceThis paper considers a common tournament design in doubles pickleball where N players compete across n matches. The research question involves the assignment of partners and opponents over the n matches.
Tim Swartz, Boxin Tang
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Despite growing interest in corporate relocation decisions and sustainability, the existing literature is limited in its consumer‐centric approach. Integrating social exchange theory and construal level theory, this research investigates how consumers perceive sustainability‐driven nearshoring motives (i.e., socio‐economic vs.
Cagla Dayangan +2 more
wiley +1 more source
Repairable Replication-based Storage Systems Using Resolvable Designs [PDF]
, 2012 We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and
Olmez, Oktay +2 more
core +4 more sources