7 citations · 27 across the 13 of their papers we have counts for
17 papers
Simplifying modular lattices by removing doubly irreducible elements
Jukka Kohonen
Lattices are simplified by removing some of their doubly irreducible elements, resulting in smaller lattices called racks. All vertically indecomposable modular racks of …
Cartesian lattice counting by the vertical 2-sum
Jukka Kohonen
A vertical 2-sum of a two-coatom lattice and a two-atom lattice is obtained by removing the top of and the bottom of , and identifying the coatoms of with the at…
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
Utsav Sheth, Sanghamitra Dutta, Malhar Chaudhari +5
We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix…
Counting graded lattices of rank three that have few coatoms
Jukka Kohonen
We consider the problem of computing , the number of unlabeled graded lattices of rank that contain coatoms and atoms. More specifically we do this when is…
Exponential lower bounds of lattice counts by vertical sum and 2-sum
Jukka Kohonen
We consider the problem of finding lower bounds on the number of unlabeled -element lattices in some lattice family. We show that if the family is closed under vertical sum, exp…
Planar additive bases for rectangles
Jukka Kohonen, Visa Koivunen, Robin Rajamäki
We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such…