On the ascending and descending chain conditions in the lattice of monoid varieties

In this work we consider monoids as algebras with an associative binary operation and the nullary operation that fixes the identity element. We found an example of two varieties of monoids with finite subvariety lattices such that their join covers one of them and has a continuum cardinality subvariety lattice that violates the ascending chain condition and the descending chain condition.Comment: 15 page

On the lattice of overcommutative varieties of monoids

It is unknown so far, whether the lattice of all varieties of monoids satisfies some non-trivial identity. The objective of this note is to give the negative answer to this question. Namely, we prove that any finite lattice is a homomorphic image of some sublattice of the lattice of overcommutative varieties of monoids (i.e., varieties that contain the variety of all commutative monoids). This implies that the lattice of overcommutative varieties of monoids and therefore, the lattice of all varieties of monoids does not satisfy any non-trivial identity.Comment: 5 page

A new example of a limit variety of monoids

A variety of universal algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. Until recently, only two explicit examples of limit varieties of monoids, constructed by Jackson, were known. Recently Zhang and Luo found the third example of such a variety. In our work, one more example of a limit variety of monoids is given.Comment: 16 page

Special elements of the lattice of monoid varieties

We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a completely regular or a commutative variety. Finally, we verify that all commutative varieties of monoids are codistributive elements of $\mathbb{MON}$. Thus, the problems of describing codistributive or upper-modular elements of $\mathbb{MON}$ are completely reduced to the completely regular case.Comment: 12 page

Lower bounds for the length of reset words in eulerian automata

For each odd n ≥ 5 we present a synchronizing Eulerian automaton with n states for which the minimum length of reset words is equal to n 2-3n+4/2. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its underlying graph. © 2013 World Scientific Publishing Company

Transversal-rotational and zero group velocity modes in tunable magneto-granular phononic crystals

We report on the design and operation of a 1D magneto-granular phononic crystal composed of a chain of steel spherical beads on top of permanent magnets. The magnetic field of the permanent magnets induces forces in the granular structure. By changing its strength, we can tune the dynamic response of the granular structure. We present experimental results with evidence of coupled transversal-rotational modes, and zero group velocities modes. These observations are well supported by a proposed model taking into account the mechanical coupling between the beads and the magnets by linear stiffnesses and including all degrees of freedom in translations and rotations