Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [self-distributivity]

The tag has no usage guidance.

-1
votes
0answers
20 views

Basic questions about varieties of uniformly partially permutative algebras

Define the Fibonacci terms $t_{n}(x,y)$ for all $n\geq 1$ by letting $t_{1}(x,y)=y,t_{2}(x,y)=x,t_{n+2}(x,y)=t_{n+1}(x,y)*t_{n}(x,y)$. We say that an algebra $(X,*)$ is $N$-uniformly partially ...
0
votes
0answers
9 views

Cardinalities of finite uniformly partially permutative algebras

Define the Fibonacci terms $t_{n}(x,y)$ for all $n\geq 1$ by letting $t_{1}(x,y)=y,t_{2}(x,y)=x,t_{n+2}(x,y)=t_{n+1}(x,y)*t_{n}(x,y)$. We say that an algebra $(X,*)$ is $N$-uniformly partially ...
0
votes
0answers
34 views

The varieties axiomatized by join-semilattice, self-distributivity, and Fibonacci term identities

Define the Fibonacci terms $t_{n}(x,y)$ for all $n\geq 1$ by letting $t_{1}(x,y)=y,t_{2}(x,y)=x,t_{n+2}(x,y)=t_{n+1}(x,y)*t_{n}(x,y)$. For $N\geq 1$, let the variety $V_{N}$ consist of all algebras $(...
1
vote
0answers
60 views

Why does $p_{n}(i,1)=1$ so often where the polynomials $p_{n}$ are obtained from the classical Laver tables

So I was doing some computer calculations with the classical Laver tables and I found polynomials $p_{n}(x,y)$ such that $p_{n}(i,1)=1$ for many $n$. The $n$-th classical Laver table is the unique ...
0
votes
0answers
91 views

Infinite products of complex numbers or matrices arising from rank-into-rank embeddings

I wonder what kinds of closed form infinite products of matrices, elements of Banach algebras, and complex numbers arise from the rank-into-rank embeddings. Suppose that $\lambda$ is a cardinal and $...
1
vote
0answers
29 views

Growth rate of the critical points of the Fibonacci terms $t_{n}(x,y)$ vs $t_{n}(1,1)$ in the classical Laver tables

The classical Laver table $A_{n}$ is the unique algebra $(\{1,\dots,2^{n}\},*_{n})$ where $x*_{n}(y*_{n}z)=(x*_{n}y)*_{n}(x*_{n}z)$ and $x*_{n}1=x+1\mod 2^{n}$ for all $x,y,z\in A_{n}$. Define the ...
1
vote
0answers
26 views

Attraction in Laver tables

If $X$ is a self-distributive algebra, then define $x^{[n]}$ for all $n\geq 1$ by letting $x^{[1]}=x$ and $x^{[n+1]}=x*x^{[n]}$. The motivation for this question comes from the following fact about ...
1
vote
0answers
43 views

Multiple roots in the classical Laver tables

The classical Laver table $A_{n}$ is the unique algebraic structure $$(\{1,\dots,2^{n}\},*_{n})$$ such that $x*_{n}1=x+1\mod 2^{n}$ and $$x*_{n}(y*_{n}z)=(x*_{n}y)*_{n}(x*_{n}z)$$ for all $x,y,z\in\{1,...
1
vote
0answers
39 views

Can we have $\sup\{\alpha\mid(x*x)^{\sharp}(\alpha)>x^{\sharp}(\alpha)\}=\infty$ in an algebra resembling the algebras of elementary embeddings?

A finite algebra $(X,*,1)$ is a reduced Laver-like algebra if it satisfies the identities $x*(y*z)=(x*y)*(x*z)$ and if there is a surjective function $\mathrm{crit}:X\rightarrow n+1$ where $\mathrm{...
1
vote
0answers
38 views

In the classical Laver tables, do we have $o_{n}(1)<o_{n}(2)$ for any $n>8$?

The classical Laver table $A_{n}$ is the unique algebraic structure $(\{1,\dots,2^{n}\},*_{n})$ where $$x*_{n}(y*_{n}z)=(x*_{n}y)*_{n}(x*_{n}z)$$ and where $$x*_{n}1=x+1\mod 2^{n}$$ for $x,y,z\in\{1,\...
1
vote
0answers
31 views

What possible order type can the critical points of these algebras with one generator achieve?

Suppose that $(X,*)$ is an algebra that satisfies the self-distributivity identity $x*(y*z)=(x*y)*(x*z)$. We say that an element $x\in X$ is a left-identity if $x*y=y$ for all $x\in X$. Let $\mathrm{...
2
votes
0answers
66 views

For each $n$ is it possible to have $\mathrm{crit}(x^{[n]}*y)>\mathrm{crit}(x^{[n-1]}*y)>\dots>\mathrm{crit}(x*y)$?

Suppose that $(X,*,1)$ satisfies the following identities: $x*(y*z)=(x*y)*(x*z),1*x=x,x*1=1$. Define the Fibonacci terms $t_{n}(x,y)$ for $n\geq 1$ by letting $$t_{1}(x,y)=y,t_{2}(x,y)=x,t_{n+2}(x,y)=...
1
vote
0answers
26 views

Vastness of inverse systems of Laver-like algebras

Suppose that $(X,*,1)$ satisfies the identities $x*(y*z)=(x*y)*(x*z),x*1=1,1*x=x$. Then we say that $(X,*,1)$ is a reduced Laver-like algebra if whenever $x_{n}\in X$ for all $n\in\omega$, there is ...
1
vote
0answers
21 views

Can we always extend a finitely generated reduced Laver-like algebra to a vast inverse system of Laver-like algebras?

An $(X,*,1)$ that satisfies the identities $x*(y*z)=(x*y)*(x*z),1*x=x,x*1=1$ is said to be a reduced Laver-like algebra if whenever $x_{n}\in X$ for $n\in\omega$, there is some $N\in\omega$ where $x_{...
0
votes
0answers
31 views

Are the Laver-like algebras $(X,*)$ such that $\mathrm{crit}(x*x*y)>\mathrm{crit}(x*y)$ dense?

Suppose that $(X,*)$ satisfies the self-distributivity identity $x*(y*z)=(x*y)*(x*z)$. Then we say that $(X,*)$ is a reduced Laver-like algebra if there is some unique $1\in X$ that satisfies the ...
0
votes
0answers
42 views

Growth rate on some algebras on one generator

Suppose that $(X,*)$ is a finite algebraic structure that satisfies the self-distributivity identity $x*(y*z)=(x*y)*(x*z)$. A subset $L\subseteq X$ is said to be a left-ideal if $x*y\in L$ whenever $y\...
3
votes
0answers
124 views

Ordering large cardinal axioms around the level of $n$-huge by consistency strength?

So the large cardinal axioms are for the most part considered to be linearly ordered by consistency strength. For the large cardinals between extendibility and rank-into-rank (i.e. the $n$-huge ...
2
votes
0answers
41 views

Calibrating the strength of the quotients of subalgebras of the classical Laver tables

Define an algebraic structure $A_{n}$ by letting $$A_{n}=(\{1,\dots,2^{n}-1,2^{n}\},*_{n})$$ where $*_{n}$ is the unique operation such that $x*_{n}1=x+1\mod 2^{n}$ for $$x\in\{1,\dots,2^{n}-1,2^{n}\}$...
0
votes
0answers
40 views

Are these conditions sufficient for a self-distributive algebra to occur in the algebras of elementary embeddings?

Suppose that $\mathcal{E}_{\lambda}$ is the set of all elementary embeddings $j:V_{\lambda}\rightarrow V_{\lambda}$ and $*$ is the operation on $\mathcal{E}_{\lambda}$ defined by $j*k=\bigcup_{\alpha&...
1
vote
0answers
26 views

Density of different types of critical points in an algebra of elementary embeddings

Suppose that $j,k:V_{\lambda}\rightarrow V_{\lambda}$ are elementary embeddings. Let $\mathrm{crit}_{n}(j,k)$ denote the $n$-th element in $\{\mathrm{crit}(\ell)\mid\ell\in\langle j,k\rangle\}$. ...
1
vote
0answers
28 views

Density of critical points subalgebras of the algebras of elementary embeddings

Let $j:V_{\lambda}\rightarrow V_{\lambda}$ be an elementary embedding. Then $\{\mathrm{crit}(k)\mid k\in\langle j\rangle\}$ has order type $\omega$, so let $\mathrm{crit}_{n}(j)$ denote the $n$-th ...
1
vote
0answers
30 views

Is every critically subsimple Laver-like algebra a quotient of a critically simple Laver-like algebra on the same number of generators?

A finite reduced Laver-like algebra is a finite algebra $(X,*,1)$ that satisfies the identities $1*x=x,x*1=1,x*(y*z)=(x*y)*(x*z)$ and where there is a natural number $n$ and a function $\mathrm{crit}:...
3
votes
0answers
76 views

Why do highly composite rows on the bad Laver tables have longer periods?

For all natural numbers $n$, let $(B_{n},*_{n})$ be the algebraic structure with underlying set $\{1,\dots,n\}$ where $x*_{n}1=x+1\mod n$, $n*_{n}y=y$, and $x*_{n}(y+1)=(x*_{n}y)*_{n}(x+1)$ for $x<...
1
vote
0answers
56 views

Which varieties are compatible with the classical Laver tables?

Let $$A_{n}=(\{1,\dots,2^{n}-1,2^{n}\},*_{n})$$ denote the $n$-th classical Laver table. The operation $*_{n}$ is the unique binary operation on $\{1,\dots,2^{n}\}$ such that $$x*_{n}(y*_{n}z)=(x*_{n}...
5
votes
0answers
68 views

The descriptive complexity and definiteness of the space of all elementary embeddings $j:V_{\lambda+1}\rightarrow V_{\lambda+1}$

Let $\mathcal{E}_{\lambda}$ be the set of all elementary embeddings $j:V_{\lambda}\rightarrow V_{\lambda}$. Suppose that $(\alpha_{n})_{n}$ is an increasing cofinal sequence in $\lambda$. Give $\...
2
votes
0answers
53 views

Can a finitely generated algebra of rank-into-rank embeddings grow at rate $O(n\cdot\log(n))$?

Let $\mathcal{E}_{\lambda}$ be the set of all elementary embeddings from $V_{\lambda}$ to $V_{\lambda}$. If $j\in\mathcal{E}_{\lambda}$ is a non-trivial elementary embedding, then define $\mathrm{crit}...
0
votes
0answers
103 views

Can Laver tables go extinct?

An algebra $(X,*)$ is said to be self-distributive if it satisfies the identity $x*(y*z)=(x*y)*(x*z)$ for all $x,y,z\in X$. If $(X,*)$ is an algebra, then a subset $L\subseteq X$ is said to be a left-...
0
votes
0answers
20 views

Is the action of free self-distributive algebras on racks computable in polynomial time?

Let $B_{\infty}$ denote the infinite strand braid group. Let $\mathrm{sh}:B_{\infty}\rightarrow B_{\infty}$ be the mapping where $\mathrm{sh}(\sigma_{i})=\sigma_{i+1}$ whenever $i\geq 1$. Then $B_{\...
0
votes
0answers
17 views

Does shifted conjugacy still give you free self-distributive algebras on one generator for quotient groups of the braid groups?

Let $B_{\infty}$ denote the infinite strand braid group. Let $\mathrm{sh}:B_{\infty}\rightarrow B_{\infty}$ be the group homomorphism where $\mathrm{sh}(\sigma_{i})=\sigma_{i+1}$ for all $i>0$. ...
4
votes
0answers
99 views

How many compatible linear orders exist on the classical Laver tables?

Let $A_{n}$ be the unique algebra $(\{1,\dots,2^{n}\},*_{n})$ such that $x*_{n}1=x+1\mod 2^{n}$ and $x*_{n}(y*_{n}z)=(x*_{n}y)*_{n}(x*_{n}z)$ for all $x,y,z$. We say that a linear ordering $\preceq$ ...