Jeremy F. Alm
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jeremy F. Alm has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Jacob Manske
Epic Systems Corporation Verona 53593 Wisconsin
3 shared publications - Roger D. Maddux
Department of Mathematics, Iowa State University, Ames, IA 50011, USA
3 shared publications - Robin Hirsch
Department of Computer Science, University College London, London, UK
2 shared publications Aaron Schneider
Department of Mathematics Illinois College 1101 W. College Ave. 62650 Jacksonville IL
1 shared publication- Andrew Ylvisaker1 shared publication
- Carolyn Langhoff1 shared publication
Latest Publications
- 30 July 2022
- Published by Springer Nature in Algebra universalis
- Vol. 83 (3) , 1-18
Improved bounds on the size of the smallest representation of relation algebra $32_{65}$- 30 July 2022
- Published by Springer Nature in Algebra universalis
- Vol. 83 (3) , 1-18
Improved bounds on the size of the smallest representation of relation algebra $32_{65}$- Open AccessImproved bounds on the size of the smallest representation of relation algebra $32_{65}$In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in $\text{Spec}(A_{n})$ is at most $2n^{6 + o(1)}$, which is the first polynomial bound and improves upon the previous bound due to Dodd \& Hirsch (\textit{J. Relational Methods in Computer Science} 2013). We also improve the lower bound to $2n^{2} + 4n + 1$, which is asymptotically double the trivial bound of $n^{2} + 2n + 3$. In the process, we obtain stronger results regarding $\text{Spec}(A_{2}) =\text{Spec}(32_{65})$. Namely, we show that $1024$ is in the spectrum, and no number smaller than 26 is in the spectrum. Our improved lower bounds were obtained by employing a SAT solver, which suggests that such tools may be more generally useful in obtaining representation results.Open AccessImproved bounds on the size of the smallest representation of relation algebra $32_{65}$In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in $\text{Spec}(A_{n})$ is at most $2n^{6 + o(1)}$, which is the first polynomial bound and improves upon the previous bound due to Dodd \& Hirsch (\textit{J. Relational Methods in Computer Science} 2013). We also improve the lower bound to $2n^{2} + 4n + 1$, which is asymptotically double the trivial bound of $n^{2} + 2n + 3$. In the process, we obtain stronger results regarding $\text{Spec}(A_{2}) =\text{Spec}(32_{65})$. Namely, we show that $1024$ is in the spectrum, and no number smaller than 26 is in the spectrum. Our improved lower bounds were obtained by employing a SAT solver, which suggests that such tools may be more generally useful in obtaining representation results.
- Open Access
Generalizing $p$-goodness to ordered graphs
It is known that the connected graphs that are $p$-good for all $p$ are the trees. In this paper, we ask which ordered trees are order-$p$-good for all $p$.Open AccessGeneralizing $p$-goodness to ordered graphs
It is known that the connected graphs that are $p$-good for all $p$ are the trees. In this paper, we ask which ordered trees are order-$p$-good for all $p$. - 16 May 2019
- Published by Springer Nature in Algebra universalis
- Vol. 80 (2) , 19
A reduced upper bound for an edge-coloring problem from relation algebra
- 16 May 2019
- Published by Springer Nature in Algebra universalis
- Vol. 80 (2) , 19
A reduced upper bound for an edge-coloring problem from relation algebra
- 19 November 2018
- Published by Springer Nature in Algebra universalis
- Vol. 79 (4) , 87
Finite representations for two small relation algebras
- 19 November 2018
- Published by Springer Nature in Algebra universalis
- Vol. 79 (4) , 87
Finite representations for two small relation algebras
- 12 July 2018
- Published by Springer Nature in Algebra universalis
- Vol. 79 (3) , 54
Representability of Lyndon–Maddux relation algebras
- 12 July 2018
- Published by Springer Nature in Algebra universalis
- Vol. 79 (3) , 54
Representability of Lyndon–Maddux relation algebras
- Open AccessA fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over $\mathbb{Z}/p\mathbb{Z}$Proper relation algebras can be constructed using $\mathbb{Z}/p\mathbb{Z}$ as a base set using a method due to Comer. The cycle structure of such an algebra must, in general, be determined \emph{a posteriori}, normally with the aid of a computer. In this paper, we give an improved algorithm for checking the cycle structure that reduces the time complexity from $\mathcal{O}(p^2)$ to $\mathcal{O}(p)$.Open AccessA fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over $\mathbb{Z}/p\mathbb{Z}$Proper relation algebras can be constructed using $\mathbb{Z}/p\mathbb{Z}$ as a base set using a method due to Comer. The cycle structure of such an algebra must, in general, be determined \emph{a posteriori}, normally with the aid of a computer. In this paper, we give an improved algorithm for checking the cycle structure that reduces the time complexity from $\mathcal{O}(p^2)$ to $\mathcal{O}(p)$.
- Open Access
Finite representations for two small relation algebras
In this note, we give two different proofs that relation algebra $52_{65}$ is representable over a finite set. The first is probabilistic, and uses Johnson schemes. The second is an explicit group representation over $ (\mathbb{Z}/2\mathbb{Z})^{10}$. We also give a finite representation of $59_{65}$ over $\mathbb{Z}/113\mathbb{Z}$ using a technique due to Comer.Open AccessFinite representations for two small relation algebras
In this note, we give two different proofs that relation algebra $52_{65}$ is representable over a finite set. The first is probabilistic, and uses Johnson schemes. The second is an explicit group representation over $ (\mathbb{Z}/2\mathbb{Z})^{10}$. We also give a finite representation of $59_{65}$ over $\mathbb{Z}/113\mathbb{Z}$ using a technique due to Comer. - Open Access
401 and beyond: improved bounds and algorithms for the Ramsey algebra search
In this paper, we discuss an improvement of an algorithm to search for primes $p$ and coset-partitions of Z/pZ* that yield Ramsey algebras over Z/pZ. We also prove an upper bound on the modulus p in terms of the number of cosets. We have, as a corollary, that there is no prime $p$ for which there exists a partition of Z/pZ* into 13 cosets that yields a 13-color Ramsey algebra. Thus A263308(13) = 0.Open Access401 and beyond: improved bounds and algorithms for the Ramsey algebra search
In this paper, we discuss an improvement of an algorithm to search for primes $p$ and coset-partitions of Z/pZ* that yield Ramsey algebras over Z/pZ. We also prove an upper bound on the modulus p in terms of the number of cosets. We have, as a corollary, that there is no prime $p$ for which there exists a partition of Z/pZ* into 13 cosets that yields a 13-color Ramsey algebra. Thus A263308(13) = 0. - 12 August 2016
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 9 (3) , 511-521
THERE IS NO FINITE-VARIABLE EQUATIONAL AXIOMATIZATION OF REPRESENTABLE RELATION ALGEBRAS OVER WEAKLY REPRESENTABLE RELATION ALGEBRAS
We prove that any equational basis that defines representable relation algebras (RRA) over weakly representable relation algebras (wRRA) must contain infinitely many variables. The proof uses a construction of arbitrarily large finite weakly representable but not representable relation algebras whose “small” subalgebras are representable.
- 12 August 2016
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 9 (3) , 511-521
THERE IS NO FINITE-VARIABLE EQUATIONAL AXIOMATIZATION OF REPRESENTABLE RELATION ALGEBRAS OVER WEAKLY REPRESENTABLE RELATION ALGEBRAS
We prove that any equational basis that defines representable relation algebras (RRA) over weakly representable relation algebras (wRRA) must contain infinitely many variables. The proof uses a construction of arbitrarily large finite weakly representable but not representable relation algebras whose “small” subalgebras are representable.