<em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

    <em id="zlul0"></em>

      <dl id="zlul0"></dl>
        <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
        <em id="zlul0"></em>

        <div id="zlul0"><ol id="zlul0"></ol></div>

        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.

        3
        votes
        1answer
        133 views

        Racks with “trichotomy”

        (This is a follow-up question; the original question was about shelves.) A rack $(R, \rhd, \lhd)$ is a set $R$ with two binary operations $\rhd$ and $\lhd$ such that for all $x, y, z \in R$: $x \rhd ...
        3
        votes
        1answer
        295 views

        Shelves with “trichotomy”

        A left shelf $(S, \rhd)$ is a magma with the left self-distributive law: $$ \forall x, y, z \in S: x \rhd (y \rhd z) = (x \rhd y) \rhd (x \rhd z). $$ Shelves are generalization of racks and quandles ...
        1
        vote
        0answers
        77 views

        Examples of nilpotent self-distributive algebras

        Suppose that $(X,*,1)$ is an algebra that satisfies the identities $x*(y*z)=(x*y)*(x*z),x*1=1,1*x=x$. Define the right powers by letting $x^{[1]}=x$ and $x^{[n+1]}=x*x^{[n]}$. We say that $(X,*,1)$ is ...
        1
        vote
        0answers
        105 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
        25 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
        42 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
        69 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
        115 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
        39 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
        28 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
        46 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
        39 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,\...
        2
        votes
        0answers
        34 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
        68 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)=...

        15 30 50 per page
        山西福彩快乐十分钟
          <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

          <em id="zlul0"></em>

            <dl id="zlul0"></dl>
              <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
              <em id="zlul0"></em>

              <div id="zlul0"><ol id="zlul0"></ol></div>
                <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

                <em id="zlul0"></em>

                  <dl id="zlul0"></dl>
                    <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
                    <em id="zlul0"></em>

                    <div id="zlul0"><ol id="zlul0"></ol></div>