English
Related papers

Related papers: Minimal complete Shidoku symmetry groups

200 papers

Monodromy in analytic families of smooth complex surfaces yields groups of isotopy classes of orientation preserving diffeomorphisms for each family member X. For all deformation classes of minimal elliptic surfaces with p_g>q=0, we…

Algebraic Geometry · Mathematics 2007-05-23 Michael Lönne

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

Group Theory · Mathematics 2018-03-06 Hung P. Tong-Viet

We consider symmetric (not complete intersection) numerical semigroups S_6, generated by a set of six positive integers {d_1,...,d_6}, gcd(d_1,...,d_6)=1, and derive inequalities for degrees of syzygies of such semigroups and find the lower…

Commutative Algebra · Mathematics 2018-08-29 Leonid G. Fel

A new way of constructing fusion bases (i.e., the set of inequalities governing fusion rules) out of fusion elementary couplings is presented. It relies on a polytope reinterpretation of the problem: the elementary couplings are associated…

High Energy Physics - Theory · Physics 2014-11-18 L. Bégin , C. Cummins , L. Lapointe , P. Mathieu

Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows $n_1$ and the number of columns $n_2$ of the associated adjacency matrix are of different order, existing methods…

Statistics Theory · Mathematics 2023-02-28 Guillaume Braun , Hemant Tyagi

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

Geometric Topology · Mathematics 2017-05-11 Jun Ge , Slavik Jablan , Louis H. Kauffman , Pedro Lopes

Any representation of data involves arbitrary investigator choices. Because those choices are external to the data-generating process, each choice leads to an exact symmetry, corresponding to the group of transformations that takes one…

Machine Learning · Statistics 2023-06-29 Soledad Villar , David W. Hogg , Weichi Yao , George A. Kevrekidis , Bernhard Schölkopf

We construct certain subgroups of hyperbolic triangle groups which we call "congruence" subgroups. These groups include the classical congruence subgroups of SL_2(ZZ), Hecke triangle groups, and 19 families of arithmetic triangle groups…

Number Theory · Mathematics 2015-06-04 Pete L. Clark , John Voight

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Combinatorics · Mathematics 2013-11-28 Hye Jung Kim , J. B. Nation , Anne V. Shepler

Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…

Group Theory · Mathematics 2021-04-01 Jeremiah Johnson

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

Representation Theory · Mathematics 2020-12-09 Olivier Brunat , Jean-Baptiste Gramain , Nicolas Jacon

We study the connectedness of the moduli space of gauge equivalence classes of flat G-connections on a compact orientable surface or a compact nonorientable surface for a class of compact connected Lie groups. This class includes all the…

Symplectic Geometry · Mathematics 2007-05-23 Nan-Kuo Ho , Chiu-Chu Melissa Liu

Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In…

Combinatorics · Mathematics 2012-09-11 sarah-marie belcastro , Ruth Haas

We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…

We study a shift action defined on multipartitions and on residue multisets of their Young diagrams. We prove that the minimal orbit cardinality among all multipartitions associated to a given multiset depends only on the orbit cardinality…

Representation Theory · Mathematics 2019-04-18 Salim Rostam

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…

Reduction of couplings in supersymmetric GUTs is achieved by searching for renormalization group invariant (RGI) relations among couplings which hold beyond the unification scale. Finiteness is due to the fact that there exist RGI relations…

High Energy Physics - Phenomenology · Physics 2009-10-30 J. Kubo , M. Mondragon , G. Zoupanos

In this paper we study the (co)homology of Tanabe algebras, which are a family of subalgebras of the partition algebras exhibiting a Schur-Weyl duality with certain complex reflection groups. The homology of the partition algebras has been…

Algebraic Topology · Mathematics 2025-12-02 Andrew Fisher , Daniel Graves

Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…

Combinatorics · Mathematics 2022-09-02 Alessio D'Alì , Emanuele Delucchi , Mateusz Michałek

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…

Information Theory · Computer Science 2021-11-24 Ioannis Kontoyiannis , Yi Heng Lim , Katia Papakonstantinopoulou , Wojtek Szpankowski
‹ Prev 1 8 9 10 Next ›