Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Pula Kyle"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 331-352 (2014)
An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai mult
Externí odkaz:
https://doaj.org/article/f0f0383128724a32ba1c9256eaeaa7cc
Publikováno v:
J. Combin. Des. 29 (2021), 511-527
A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of a diagonal
Externí odkaz:
http://arxiv.org/abs/1911.05936
The difficulty in obtaining labeled data relevant to a given task is among the most common and well-known practical obstacles to applying deep learning techniques to new or even slightly modified domains. The data volumes required by the current gene
Externí odkaz:
http://arxiv.org/abs/1908.03809
Publikováno v:
J. Combinatorial Designs 20 (2012), 161-197
We study incidence properties among cosets of finite loops, with emphasis on well-structured varieties such as antiautomorphic loops and Bol loops. While cosets in groups are either disjoint or identical, we find that the incidence structure in gener
Externí odkaz:
http://arxiv.org/abs/1108.3656
Autor:
Pula, Kyle
Publikováno v:
Commentationes Mathematicae Universitatis Carolinae, Volume 49(2), pp 291-299. 2008
A Jordan loop is a commutative loop satisfying the Jordan identity $(x^2 y) x = x^2 (y x)$. We establish several identities involving powers in Jordan loops and show that there is no nonassociative Jordan loop of order $9$.
Comment: 7 pages, 3 f
Comment: 7 pages, 3 f
Externí odkaz:
http://arxiv.org/abs/1008.0700
Autor:
Pula, Kyle
Publikováno v:
Electronic Journal of Combinatorics, Volume 16(1). May 2009
For a finite loop $Q$, let $P (Q)$ be the set of elements that can be represented as a product containing each element of $Q$ precisely once. Motivated by the recent proof of the Hall-Paige conjecture, we prove several universal implications between
Externí odkaz:
http://arxiv.org/abs/1008.0699
Autor:
Pula, Kyle
A $k$-plex of a latin square is a collection of cells representing each row, column, and symbol precisely $k$ times. The classic case of $k=1$ is more commonly known as a transversal. We introduce the concept of a $k$-weight, an integral weight funct
Externí odkaz:
http://arxiv.org/abs/1008.0176
Autor:
Pula, Kyle
A complete edge-colored graph or multigraph is called Gallai if it lacks rainbow triangles. We give a construction of all finite Gallai multigraphs.
Comment: 16 pages, 5 figures
Comment: 16 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/0707.0084
Publikováno v:
J. Combinatorial Designs 17 (2009), no. 2, 103-118
A commutative loop is Jordan if it satisfies the identity $x^2 (y x) = (x^2 y) x$. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order $n$ exists if and only if $n\geq 6$ and $n\neq 9$. We also c
Externí odkaz:
http://arxiv.org/abs/0705.3445
Autor:
Best, Darcy1 (AUTHOR), Pula, Kyle1 (AUTHOR), Wanless, Ian M.1 (AUTHOR) ian.wanless@monash.edu
Publikováno v:
Journal of Combinatorial Designs. Jul2021, Vol. 29 Issue 8, p511-527. 17p.