相关论文: Composing (with) automorphisms in the colored Cube…
The discovery of colour-kinematic duality has led to significant progress in the computation of scattering amplitudes in quantum field theories. At tree level, the origin of the duality can be traced back to the monodromies of open-string…
Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, which entails automatic homeomorphicity. We further…
Graphite and diamond are two well-known allotropes of carbon with distinct physical properties due to different atomic connectivity. Graphite has a layered structure in which the honeycomb carbon sheets can easily glide, while atoms in…
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
Endowed with the binary operation of set addition carried over from the integers, the family $\mathcal P_{\mathrm{fin}}(\mathbb Z) $ of all non-empty finite subsets of $\mathbb Z$ forms a monoid whose neutral element is the singleton…
Any $C^d$ conservative map $f$ of the $d$-dimensional unit ball $\mathbb B^d$ can be realized by renormalized iteration of a $C^d$ perturbation of identity: there exists a conservative diffeomorphism of $\mathbb B^d$, arbitrarily close to…
Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…
In this note we show every orientation of a connected cubic graph admits an oriented 8-colouring. This lowers the best-known upper bound for the chromatic number of the family of orientations of connected cubic graphs. We further show that…
Pseudodiagrams are diagrams of knots where some information about which strand goes over/under at certain crossings may be missing. Pseudoknots are equivalence classes of pseudodiagrams, with equivalence defined by a class of…
We introduce the free inhomogeneous wreath product of compact matrix quantum groups, which generalizes the free wreath product (Bichon 2004). We use this to present a general technique to determine quantum automorphism groups of connected…
We present a generative model for complex free-form structures such as stroke-based drawing tasks. While previous approaches rely on sequence-based models for drawings of basic objects or handwritten text, we propose a model that treats…
A combination of three or more tones played together is called a chord. In the chromatic scale, chords which are consonant are of particular interest and can be divided into several groups, two main ones being the major and minor chords.…
Music is usually highly structured and it is still an open question how to design models which can successfully learn to recognize and represent musical structure. A fundamental problem is that structurally related patterns can have very…
Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
This paper examines a pair of bent functions on $\mathbb{Z}_2^{2m}$ and their relationship to a necessary condition for the existence of an automorphism of an edge-coloured graph whose colours are defined by the properties of a canonical…
We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergraph), that is, the group of all automorphisms of the given…
Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…
Melody harmonization, which involves generating a chord progression that complements a user-provided melody, continues to pose a significant challenge. A chord progression must not only be in harmony with the melody, but also interdependent…