Lars-Daniel Öhman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lars-Daniel Öhman has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Denys Shcherbak
Umeå Universitet
3 shared publications - Gerold Jäger
Department of Mathematics and Mathematical Statistics University of Umeå SE-901-87 Umeå Sweden
3 shared publications - Klas Markström
Umeå Universitet Umeå Sweden
3 shared publications - Manya Raman-Sundström
*Department of Science and Mathematics Education, Umeå University, Umeå, SE-90187, Sweden
2 shared publications - Klara Stokes
Universitat Rovira i Virgili
1 shared publication - Klara Stokes
Department of Mathematics and Mathematical Statistics Umeå University Umeå Sweden
1 shared publication
Latest Publications
- Open Access
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually orthogonal Latin squares and MOLR, namely that each Latin rectangle in a set of MOLR is isotopic to each other rectangle in the set. We call such a set of MOLR \emph{homogeneous}. In the course of doing this, we perform a complete enumeration of non-isotopic sets of $t$ mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$, for all $t < n$. Specifically, we keep track of homogeneous sets of MOLR, as well as sets of MOLR where the autotopism group acts transitively on the rectangles, and we call such sets of MOLR \emph{transitive}. We build the sets of MOLR row by row, and in this process we also keep track of which of the MOLR are homogeneous and/or transitive in each step of the construction process. We use the prefix \emph{stepwise} to refer to sets of MOLR with this property. Sets of MOLR are connected to other discrete objects, notably finite geometries and certain regular graphs. Here we observe that all projective planes of order at most 9 except the Hughes plane can be constructed from a stepwise transitive MOLR.Open AccessEnumeration of Sets of Mutually Orthogonal Latin Rectangles
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually orthogonal Latin squares and MOLR, namely that each Latin rectangle in a set of MOLR is isotopic to each other rectangle in the set. We call such a set of MOLR \emph{homogeneous}. In the course of doing this, we perform a complete enumeration of non-isotopic sets of $t$ mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$, for all $t < n$. Specifically, we keep track of homogeneous sets of MOLR, as well as sets of MOLR where the autotopism group acts transitively on the rectangles, and we call such sets of MOLR \emph{transitive}. We build the sets of MOLR row by row, and in this process we also keep track of which of the MOLR are homogeneous and/or transitive in each step of the construction process. We use the prefix \emph{stepwise} to refer to sets of MOLR with this property. Sets of MOLR are connected to other discrete objects, notably finite geometries and certain regular graphs. Here we observe that all projective planes of order at most 9 except the Hughes plane can be constructed from a stepwise transitive MOLR. - Open Access
- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.53
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually orthogonal Latin squares and MOLR, namely that each Latin rectangle in a set of MOLR is isotopic to each other rectangle in the set. We call such a set of MOLR homogeneous.In the course of doing this, we perform a complete enumeration of non-isotopic sets of $t$ mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$, for all $t < n$. Specifically, we keep track of homogeneous sets of MOLR, as well as sets of MOLR where the autotopism group acts transitively on the rectangles, and we call such sets of MOLR transitive.We build the sets of MOLR row by row, and in this process we also keep track of which of the MOLR are homogeneous and/or transitive in each step of the construction process. We use the prefix stepwise to refer to sets of MOLR with this property.Sets of MOLR are connected to other discrete objects, notably finite geometries and certain regular graphs. Here we observe that all projective planes of order at most 9 except the Hughes plane can be constructed from a stepwise transitive MOLR.- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.53
Open AccessEnumeration of Sets of Mutually Orthogonal Latin Rectangles
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually orthogonal Latin squares and MOLR, namely that each Latin rectangle in a set of MOLR is isotopic to each other rectangle in the set. We call such a set of MOLR homogeneous.In the course of doing this, we perform a complete enumeration of non-isotopic sets of $t$ mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$, for all $t < n$. Specifically, we keep track of homogeneous sets of MOLR, as well as sets of MOLR where the autotopism group acts transitively on the rectangles, and we call such sets of MOLR transitive.We build the sets of MOLR row by row, and in this process we also keep track of which of the MOLR are homogeneous and/or transitive in each step of the construction process. We use the prefix stepwise to refer to sets of MOLR with this property.Sets of MOLR are connected to other discrete objects, notably finite geometries and certain regular graphs. Here we observe that all projective planes of order at most 9 except the Hughes plane can be constructed from a stepwise transitive MOLR. - Open Access
- 19 December 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (1) , 25-48
When is a Planar Rod Configuration Infinitesimally Rigid?
We investigate the rigidity properties of rod configurations. Rod configurations are realizations of rank two incidence geometries as points (joints) and straight lines (rods) in the Euclidean plane, such that the lines move as rigid bodies, connected at the points. Note that not all incidence geometries have such realizations. We show that under the assumptions that the rod configuration exists and is sufficiently generic, its infinitesimal rigidity is equivalent to the infinitesimal rigidity of generic frameworks of the graph defined by replacing each rod by a cone over its point set. To put this into context, the molecular conjecture states that the infinitesimal rigidity of rod configurations realizing 2-regular hypergraphs is determined by the rigidity of generic body and hinge frameworks realizing the same hypergraph. This conjecture was proven by Jackson and Jordán in the plane, and by Katoh and Tanigawa in arbitrary dimension. Whiteley proved a version of the molecular conjecture for hypergraphs of arbitrary degree that have realizations as independent body and joint frameworks. Our result extends his result to hypergraphs that do not necessarily have realizations as independent body and joint frameworks, under the assumptions listed above.
- 19 December 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (1) , 25-48
Open AccessWhen is a Planar Rod Configuration Infinitesimally Rigid?
We investigate the rigidity properties of rod configurations. Rod configurations are realizations of rank two incidence geometries as points (joints) and straight lines (rods) in the Euclidean plane, such that the lines move as rigid bodies, connected at the points. Note that not all incidence geometries have such realizations. We show that under the assumptions that the rod configuration exists and is sufficiently generic, its infinitesimal rigidity is equivalent to the infinitesimal rigidity of generic frameworks of the graph defined by replacing each rod by a cone over its point set. To put this into context, the molecular conjecture states that the infinitesimal rigidity of rod configurations realizing 2-regular hypergraphs is determined by the rigidity of generic body and hinge frameworks realizing the same hypergraph. This conjecture was proven by Jackson and Jordán in the plane, and by Katoh and Tanigawa in arbitrary dimension. Whiteley proved a version of the molecular conjecture for hypergraphs of arbitrary degree that have realizations as independent body and joint frameworks. Our result extends his result to hypergraphs that do not necessarily have realizations as independent body and joint frameworks, under the assumptions listed above.
- Open Access
- 14 April 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 336, 68-82
Exploring the rigidity of planar configurations of points and rods
- 14 April 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 336, 68-82
Open AccessExploring the rigidity of planar configurations of points and rods
- Open Access
- 6 May 2019
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 41 (3) , 33-40
Are Induction and Well-Ordering Equivalent?
- 6 May 2019
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 41 (3) , 33-40
Open AccessAre Induction and Well-Ordering Equivalent?
- Open Access
Triples of Orthogonal Latin and Youden Rectangles For Small Orders
We have performed a complete enumeration of non-isotopic triples of mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$. Here we will present a census of such triples, classified by various properties, including the order of the autotopism group of the triple. As part of this we have also achieved the first enumeration of pairwise orthogonal triples of Youden rectangles. We have also studied orthogonal triples of $k \times 8$ rectangles which are formed by extending mutually orthogonal triples with non-trivial autotopisms one row at a time, and requiring that the autotopism group is non-trivial in each step. This class includes a triple coming from the projective plane of order 8. Here we find a remarkably symmetrical pair of triples of $4 \times 8$ rectangles, formed by juxtaposing two selected copies of complete sets of MOLS of order 4.Open AccessTriples of Orthogonal Latin and Youden Rectangles For Small Orders
We have performed a complete enumeration of non-isotopic triples of mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$. Here we will present a census of such triples, classified by various properties, including the order of the autotopism group of the triple. As part of this we have also achieved the first enumeration of pairwise orthogonal triples of Youden rectangles. We have also studied orthogonal triples of $k \times 8$ rectangles which are formed by extending mutually orthogonal triples with non-trivial autotopisms one row at a time, and requiring that the autotopism group is non-trivial in each step. This class includes a triple coming from the projective plane of order 8. Here we find a remarkably symmetrical pair of triples of $4 \times 8$ rectangles, formed by juxtaposing two selected copies of complete sets of MOLS of order 4. - 1 June 2018
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 26 (2) , 184-210
Mathematical Fit: A Case Study
Mathematicians routinely pass judgements on mathematical proofs. A proof might be elegant, cumbersome, beautiful, or awkward. Perhaps the highest praise is that a proof is right, that is, that the proof fits the theorem in an optimal way. It is also common to judge that one proof fits better than another, or that a proof does not fit a theorem at all. This paper attempts to clarify the notion of mathematical fit. We suggest six criteria that distinguish proofs as being more or less fitting, and provide examples from several different mathematical fields.
- 1 June 2018
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 26 (2) , 184-210
Mathematical Fit: A Case Study
Mathematicians routinely pass judgements on mathematical proofs. A proof might be elegant, cumbersome, beautiful, or awkward. Perhaps the highest praise is that a proof is right, that is, that the proof fits the theorem in an optimal way. It is also common to judge that one proof fits better than another, or that a proof does not fit a theorem at all. This paper attempts to clarify the notion of mathematical fit. We suggest six criteria that distinguish proofs as being more or less fitting, and provide examples from several different mathematical fields.
- Open Access
- 1 January 2016
- Published by Claremont Colleges Library in Journal of Humanistic Mathematics
- Vol. 6 (1) , 3-7
The Nature and Experience of Mathematical Beauty
The editorial staff of JHM works hard to make sure the scholarship disseminated in JHM is accurate and upholds professional ethical guidelines. However the views and opinions expressed in each published manuscript belong exclusively to the individual contributor(s). The publisher and the editors do not endorse or accept responsibility for them. See https://scholarship.claremont.edu/jhm/policies.html for more information.
- 1 January 2016
- Published by Claremont Colleges Library in Journal of Humanistic Mathematics
- Vol. 6 (1) , 3-7
Open AccessThe Nature and Experience of Mathematical Beauty
The editorial staff of JHM works hard to make sure the scholarship disseminated in JHM is accurate and upholds professional ethical guidelines. However the views and opinions expressed in each published manuscript belong exclusively to the individual contributor(s). The publisher and the editors do not endorse or accept responsibility for them. See https://scholarship.claremont.edu/jhm/policies.html for more information.