Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Kyle Pula"'
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f21b1659b4e9ea6c035e41020ad659cb
http://arxiv.org/abs/1911.05936
http://arxiv.org/abs/1911.05936
Publikováno v:
Applications of Machine Learning.
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5578ca6267c3e941825785106b4c68e
https://doi.org/10.1117/12.2529586
https://doi.org/10.1117/12.2529586
Publikováno v:
Journal of Combinatorial Designs. 20:179-197
We study incidence properties among cosets of infinite 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 gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15e0dfc67b8a1f3967e6ec7d03f669e2
https://doi.org/10.1002/jcd.20308
https://doi.org/10.1002/jcd.20308
Publikováno v:
SIAM Journal on Discrete Mathematics. 26:239-249
We show that for all integers $m \geqslant 4$ there exists a $2m\times 2m\times m$ latin cuboid that cannot be completed to a $2m\times 2m\times 2m$ latin cube. We also show that for all even $m>2$ there exists a $(2m{-}1)\times(2m{-}1)\times(m{-}1)$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b7d92ad3785a815f1b087a2d132e75d
https://doi.org/10.1137/110825534
https://doi.org/10.1137/110825534
Publikováno v:
Linear Algebra and its Applications. 434(1):232-238
We consider the minimum permanents and minimising matrices on the faces of the polytope of doubly stochastic matrices whose nonzero entries coincide with those of, respectively,Um,n=InJn,mJm,n0mandVm,n=InJn,mJm,nJm,m.Here Jr,s denotes the r×s matrix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c592ba7d1df62a2ab18e1eb670990d3c
Publikováno v:
Journal of Combinatorial Designs. 17: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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d157007e4c2c50772626c6a51755e30b
https://doi.org/10.1002/jcd.20186
https://doi.org/10.1002/jcd.20186
Autor:
Kyle Pula
Publikováno v:
The Electronic Journal of Combinatorics. 16
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f5f0e951500916ff5d324af0238f48c
https://doi.org/10.37236/146
https://doi.org/10.37236/146
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::a79fe90bef69a96a239534e0d037c3ad
https://doi.org/10.7151/dmgt.1740
https://doi.org/10.7151/dmgt.1740
Autor:
Kyle Pula
Publikováno v:
Discrete Mathematics. (8-9):577-581
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21339a48a21d29f306402b1ca0a194a3