Marcel Jackson
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
Marcel Jackson has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
Tim Stokes
7 shared publications- Lucy Ham
School of BioSciences, University of Melbourne
6 shared publications - Robin Hirsch
Department of Computer Science, University College London, London, UK
6 shared publications - Brian A. Davey
La Trobe University
4 shared publications - Mikhail Konstantinovich Volkov
Ural Federal University
4 shared publications Todd Niven
School of Engineering and Mathematical Sciences, La Trobe University, VIC 3086, Australia
4 shared publications
Latest Publications
- 4 November 2026
- Published by Springer Nature in Semigroup Forum
- p. 1-2
Preface of the Special Issue dedicated to Mikhail V. Volkov on the occasion of his 70th birthday
- 4 November 2026
- Published by Springer Nature in Semigroup Forum
- p. 1-2
Preface of the Special Issue dedicated to Mikhail V. Volkov on the occasion of his 70th birthday
- Open Access
Intercellular signaling drives robust cell fate and patterning in multicellular systems
Cells do not act in isolation; they communicate with each other through a complex network of signals. In multicellular organisms, cell signaling buffers against fluctuations in gene expression. Its effect, however, on multistability—the ability of genetically identical cells to take on and maintain diverse stable states or phenotypes—is unclear. We develop spatially explicit stochastic models that couple fine-grained gene regulatory dynamics with intercellular signaling to study cell fate control in multicellular tissues. We show that intercellular signaling acts as a switch-like controller of cell fate, driving transitions from transient to stable states across tissues. Even weak signaling stabilizes short-lived expression states, and we derive mathematical expressions for the threshold signaling strength required to trigger tissue-wide stabilization. We also derive a universal spatial limit: stable region size grows only sublinearly with signaling strength, implying that large stable regions are prohibitively costly to maintain. The resulting trade-off between robustness and signaling in cell fate control highlights the delicate balance required during developmental processes to maintain spatial precision and provides insight into how organisms regulate tissue structure. Overview: Cell fate decisions in developing tissues are governed by gene regulatory networks, but how communication between neighboring cells influences these decisions is poorly understood. We develop a mathematical framework showing that intercellular signaling acts as a controller of cell fate, suppressing spontaneous switching, and inducing stable, coordinated behaviors across tissues. Even weak signaling induces a sharp transition from unstable to stable population-wide dynamics. We also derive fundamental scaling laws showing that the size of stable regions increases sublinearly with signaling strength, revealing a trade-off between developmental robustness and resource cost. These results offer insight into how organisms achieve reliable spatial organization during development, despite molecular noise, and provide design principles for engineering synthetic tissues that balance stability, scalability, and resource efficiency.
Open AccessIntercellular signaling drives robust cell fate and patterning in multicellular systems
Cells do not act in isolation; they communicate with each other through a complex network of signals. In multicellular organisms, cell signaling buffers against fluctuations in gene expression. Its effect, however, on multistability—the ability of genetically identical cells to take on and maintain diverse stable states or phenotypes—is unclear. We develop spatially explicit stochastic models that couple fine-grained gene regulatory dynamics with intercellular signaling to study cell fate control in multicellular tissues. We show that intercellular signaling acts as a switch-like controller of cell fate, driving transitions from transient to stable states across tissues. Even weak signaling stabilizes short-lived expression states, and we derive mathematical expressions for the threshold signaling strength required to trigger tissue-wide stabilization. We also derive a universal spatial limit: stable region size grows only sublinearly with signaling strength, implying that large stable regions are prohibitively costly to maintain. The resulting trade-off between robustness and signaling in cell fate control highlights the delicate balance required during developmental processes to maintain spatial precision and provides insight into how organisms regulate tissue structure. Overview: Cell fate decisions in developing tissues are governed by gene regulatory networks, but how communication between neighboring cells influences these decisions is poorly understood. We develop a mathematical framework showing that intercellular signaling acts as a controller of cell fate, suppressing spontaneous switching, and inducing stable, coordinated behaviors across tissues. Even weak signaling induces a sharp transition from unstable to stable population-wide dynamics. We also derive fundamental scaling laws showing that the size of stable regions increases sublinearly with signaling strength, revealing a trade-off between developmental robustness and resource cost. These results offer insight into how organisms achieve reliable spatial organization during development, despite molecular noise, and provide design principles for engineering synthetic tissues that balance stability, scalability, and resource efficiency.
- Open Access
- 29 July 2025
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 57 (11) , 3380-3400
Finite models for positive combinatorial and exponential algebra
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined. We also derive the decidability of the equational logical entailment operator for antecedents true on by way of a form of the finite model property. Two appendices contain additional basic development of combinatorial operations. Amongst the observations are an eventual dominance well‐ordering of combinatorial functions and consequent representation of the ordinal in terms of factorial functions; the equivalence of the equational logic of combinatorial algebra over the natural numbers and over the positive reals; and a candidate list of elementary axioms.
- 29 July 2025
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 57 (11) , 3380-3400
Open AccessFinite models for positive combinatorial and exponential algebra
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined. We also derive the decidability of the equational logical entailment operator for antecedents true on by way of a form of the finite model property. Two appendices contain additional basic development of combinatorial operations. Amongst the observations are an eventual dominance well‐ordering of combinatorial functions and consequent representation of the ordinal in terms of factorial functions; the equivalence of the equational logic of combinatorial algebra over the natural numbers and over the positive reals; and a candidate list of elementary axioms.
- Open Access
- 18 July 2025
- Published by Springer Nature in Semigroup Forum
- Vol. 111 (2) , 469-489
Minimal signatures with undecidability of representability by binary relations
A semigroup of binary relations (under composition) on a set X is complemented if it is closed under the taking of complements within $$X\times X$$ . We resolve a 1991 problem of Boris Schein by showing that the class of finite unary semigroups that are representable as complemented semigroups of binary relations is undecidable, so composition with complementation forms a minimal subsignature of Tarski’s relation algebra signature that has undecidability of representability. In addition we prove similar results for semigroups of binary relations endowed with unary operations returning the kernel and cokernel of a relation. We generalise to signatures which may include arbitrary, definable operations and provide a chain of weaker and weaker signatures, each definable in the previous signature, each having undecidability of representability, but whose limit signature includes composition only, which corresponds to the well known, decidable and finitely axiomatised variety of semigroups. All these results are also proved for representability as binary relations over a finite set.- 18 July 2025
- Published by Springer Nature in Semigroup Forum
- Vol. 111 (2) , 469-489
Open AccessMinimal signatures with undecidability of representability by binary relations
A semigroup of binary relations (under composition) on a set X is complemented if it is closed under the taking of complements within $$X\times X$$ . We resolve a 1991 problem of Boris Schein by showing that the class of finite unary semigroups that are representable as complemented semigroups of binary relations is undecidable, so composition with complementation forms a minimal subsignature of Tarski’s relation algebra signature that has undecidability of representability. In addition we prove similar results for semigroups of binary relations endowed with unary operations returning the kernel and cokernel of a relation. We generalise to signatures which may include arbitrary, definable operations and provide a chain of weaker and weaker signatures, each definable in the previous signature, each having undecidability of representability, but whose limit signature includes composition only, which corresponds to the well known, decidable and finitely axiomatised variety of semigroups. All these results are also proved for representability as binary relations over a finite set. - 3 July 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 35 (06) , 771-821
Flexible constraint satisfiability and a problem in semigroup theory
In this paper, we examine some flexible notions of constraint satisfaction, observing some relationships between model theoretic notions of universal Horn class membership and robust satisfiability. We show the NP-completeness of 2-robust positive 1-in-3SAT in order to give very small examples of finite algebras with NP-hard variety membership problem. In particular, we give a 3-element algebra with this property, and solve a widely stated problem by showing that the 6-element Brandt monoid has NP-hard variety membership problem. These are the smallest possible sizes for a general algebra and a semigroup to exhibit NP-hardness for the membership problem of finite algebras in finitely generated varieties.
- 3 July 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 35 (06) , 771-821
Flexible constraint satisfiability and a problem in semigroup theory
In this paper, we examine some flexible notions of constraint satisfaction, observing some relationships between model theoretic notions of universal Horn class membership and robust satisfiability. We show the NP-completeness of 2-robust positive 1-in-3SAT in order to give very small examples of finite algebras with NP-hard variety membership problem. In particular, we give a 3-element algebra with this property, and solve a widely stated problem by showing that the 6-element Brandt monoid has NP-hard variety membership problem. These are the smallest possible sizes for a general algebra and a semigroup to exhibit NP-hardness for the membership problem of finite algebras in finitely generated varieties.
- Open Access
The finite basis problem for additively idempotent semirings that relate to S_7
The $3$-element additively idempotent semiring $S_7$ is a nonnitely based algebra of the smallest possible order. In this paper we study the nite basis problem for some additively idempotent semirings that relate to $S_7$. We present a su cient condition under which an additively idempotent semiring variety is nonnitely based and as applications, show that some additively idempotent semiring varieties that contain $S_7$ are also nonnitely based. We then consider the subdirectly irreducible members of the variety $\mathsf{V}(S_7)$ generated by $S_7$. We show that $\mathsf{V}(S_7)$ contains exactly $6$ finitely based subvarieties, all of which sit at the base of the subvariety lattice, then invoke results from the homomorphism theory of Kneser graphs to verify that $\mathsf{V}(S_7)$ contains a continuum of subvarieties.Open AccessThe finite basis problem for additively idempotent semirings that relate to S_7
The $3$-element additively idempotent semiring $S_7$ is a nonnitely based algebra of the smallest possible order. In this paper we study the nite basis problem for some additively idempotent semirings that relate to $S_7$. We present a su cient condition under which an additively idempotent semiring variety is nonnitely based and as applications, show that some additively idempotent semiring varieties that contain $S_7$ are also nonnitely based. We then consider the subdirectly irreducible members of the variety $\mathsf{V}(S_7)$ generated by $S_7$. We show that $\mathsf{V}(S_7)$ contains exactly $6$ finitely based subvarieties, all of which sit at the base of the subvariety lattice, then invoke results from the homomorphism theory of Kneser graphs to verify that $\mathsf{V}(S_7)$ contains a continuum of subvarieties. - 21 January 2025
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 132 (4) , 316-332
Cyclic Arithmetic and Combinatorial Operations
- 21 January 2025
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 132 (4) , 316-332
Cyclic Arithmetic and Combinatorial Operations
- Open Access
Minimal signatures with undecidability of representability by binary relations
A semigroup of binary relations (under composition) on a set $X$ is \emph{complemented} if it is closed under the taking of complements within $X\times X$. We resolve a 1991 problem of Boris Schein by showing that the class of finite unary semigroups that are representable as complemented semigroups of binary relations is undecidable, so composition with complementation forms a minimal subsignature of Tarski's relation algebra signature that has undecidability of representability. In addition we prove similar results for semigroups of binary relations endowed with unary operations returning the kernel and cokernel of a relation. We generalise to signatures which may include arbitrary, definable operations and provide a chain of weaker and weaker signatures, each definable in the previous signature, each having undecidability of representability, but whose limit signature includes composition only, which corresponds to the well known, decidable and finitely axiomatised variety of semigroups. All these results are also proved for representability as binary relations over a finite set.Open AccessMinimal signatures with undecidability of representability by binary relations
A semigroup of binary relations (under composition) on a set $X$ is \emph{complemented} if it is closed under the taking of complements within $X\times X$. We resolve a 1991 problem of Boris Schein by showing that the class of finite unary semigroups that are representable as complemented semigroups of binary relations is undecidable, so composition with complementation forms a minimal subsignature of Tarski's relation algebra signature that has undecidability of representability. In addition we prove similar results for semigroups of binary relations endowed with unary operations returning the kernel and cokernel of a relation. We generalise to signatures which may include arbitrary, definable operations and provide a chain of weaker and weaker signatures, each definable in the previous signature, each having undecidability of representability, but whose limit signature includes composition only, which corresponds to the well known, decidable and finitely axiomatised variety of semigroups. All these results are also proved for representability as binary relations over a finite set. - Open Access
- 3 November 2023
- Published by Springer Nature in Semigroup Forum
- Vol. 107 (2) , 1-19
Equationally defined classes of semigroups
- 3 November 2023
- Published by Springer Nature in Semigroup Forum
- Vol. 107 (2) , 1-19
Open AccessEquationally defined classes of semigroups
- Open Access
Equationally defined classes of semigroups
We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We prove a dual to the Birkhoff theorem in that if the class is also closed under the taking of containing semigroups, some basis of equations of $\mathcal{C}$ is free of the $\forall$ quantifier. Examples are given of EHP-classes that require more than two quantifiers in some equation of any equational basis.Open AccessEquationally defined classes of semigroups
We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We prove a dual to the Birkhoff theorem in that if the class is also closed under the taking of containing semigroups, some basis of equations of $\mathcal{C}$ is free of the $\forall$ quantifier. Examples are given of EHP-classes that require more than two quantifiers in some equation of any equational basis.