相关论文: Composing (with) automorphisms in the colored Cube…

The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

We use the framework of "props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric monoidal category where the objects are natural numbers, with the tensor product of objects given by addition.…

We give a way to construct group of pseudo-automorphisms of rational varieties of any dimension that fix pointwise the image of a cubic hypersurface of $P^n. These group are free products of involutions, and most of their elements have…

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…

In this paper we review some connections between harmonic analysis and the modern theory of automorphic forms. We indicate in some examples how the study of problems of harmonic analysis brings us to the important objects of the theory of…

An automorphism $\beta$ of a $k$-graph $\Lambda$ induces a crossed product $C^* ( \Lambda ) \rtimes_\beta \mathbb{Z}$ which is isomorphic to a $(k+1)$-graph algebra $C^* ( \Lambda \times_\beta \mathbb{Z})$. In this paper we show how this…

We review several well-known operads of compactified configuration spaces and construct several new such operads, C, in the category of smooth manifolds with corners whose complexes of fundamental chains give us (i) the 2-coloured operad of…

Let $M$ be a connected orientable compact surface, $f:M\to\mathbb{R}$ be a Morse function, and $\mathcal{D}_{\mathrm{id}}(M)$ be the group of difeomorphisms of $M$ isotopic to the identity. Denote by $\mathcal{S}'(f)=\{f\circ h = f\mid…

It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…

Emotion-driven melody harmonization aims to generate diverse harmonies for a single melody to convey desired emotions. Previous research found it hard to alter the perceived emotional valence of lead sheets only by harmonizing the same…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

Curve stitching is a classic educational activity where one constructs elegant curves from a family of straight lines. We perform curve stitching around a circle to make a modular stitch graph. Take $m$ points equally spaced around a…

In this paper, we prove than given two cubic knots $K_1$, $K_2$ in $\mathbb{R}^3$, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the Reidemeister…

Emotion alignment between music and palettes is crucial for effective multimedia content, yet misalignment creates confusion that weakens the intended message. However, existing methods often generate only a single dominant color, missing…

From the homotopy groups of two cubic spherical 3-manifolds we construct the isomorphic groups of deck transformations acting on the 3-sphere. These groups become the cyclic group of order eight and the quaternion group respectively. By…

Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…