相关论文: On Automorphism Criteria for Comparing Amounts of …
We define the concept of self-similarity of an object by considering endomorphisms of the object as `similarity' maps. A variety of interesting examples of self-similar objects in geometry, algebra and arithmetic are introduced.…
According to Aristotle, a philosopher in Ancient Greece, "the whole is greater than the sum of its parts". This observation was adopted to explain human perception by the Gestalt psychology school of thought in the twentieth century. Here,…
Wigner found unreasonable the "effectiveness of mathematics in the natural sciences". But if the mathematics we use to describe nature is simply a coded expression of our experience then its effectiveness is quite reasonable. Its…
In this paper we investigate the construction of bicategories of fractions originally described by D. Pronk: given any bicategory $\mathcal{C}$ together with a suitable class of morphisms $\mathbf{W}$, one can construct a bicategory…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
Symmetries and isomorphisms play similar conceptual roles when we consider how models represent physical situations, but they are formally distinct, as two models related by symmetries are not typically isomorphic. I offer a rigorous…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
A classical theorem states that the group of automorphisms of a manifold $M$ preserving a $G$-structure of finite type is a Lie group. We generalize this statement to the category of $cs$ manifolds and give some examples, some of which…
We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…
Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…
Classical mathematics are founded within set theory, but sets don't have \emph{symmetries}. We conjecture that if we allow sets with symmetries, then many problems such as \emph{Mirror symmetry} or \emph{Homological mirror symmetry} can be…
Starting from the groupoid approach to Schwinger's picture of Quantum Mechanics, a proposal for the description of symmetries in this framework is advanced.It is shown that, given a groupoid $G\rightrightarrows \Omega$ associated with a…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
Let $G$ be a finite $p$-group and let Aut$(G)$ denote the full automorphism group of $G$. In the recent past, there has been interest in finding necessary and sufficient conditions on $G$ such that certain subgroups of Aut$(G)$ are equal.…
Physical systems with symmetries are described by functions containing kinematical and dynamical parts. We consider the case when kinematical symmetries are described by a noncompact semisimple real Lie group $G$. Then separation of…
We prove the automorphism conjecture for ordered sets of width less than or equal to 11. The proof supports the meta conjecture that a large number of automorphisms is achievable only as some type of product of independent automorphisms on…
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…