English
Related papers

Related papers: Totally symmetric sets in the general linear group

200 papers

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

Combinatorics · Mathematics 2015-03-25 Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco , Sanming Zhou

The aim of this paper is to study symmetries of linearly singular differential equations, namely, equations that can not be written in normal form because the derivatives are multiplied by a singular linear operator. The concept of…

Mathematical Physics · Physics 2009-11-07 Xavier Gracia , Josep M. Pons

The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…

Logic · Mathematics 2019-09-05 Andrei Alexandru , Gabriel Ciobanu

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

The theory of total positivity for reductive groups is here extended to the case of symmetric spaces.

Representation Theory · Mathematics 2021-09-29 G. Lusztig

The new concept of relative generic subsets is introduced. It is shown that the set of controllable linear finite-dimensional port-Hamiltonian systems is a relative generic subset of the set of all linear finite-dimensional port-Hamiltonian…

Dynamical Systems · Mathematics 2021-04-07 Jonas Kirchhoff

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Group Theory · Mathematics 2023-09-29 Nikolay Nikolov

In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…

Representation Theory · Mathematics 2007-05-23 Vladimir Shchigolev

The regular autonomous asynchronous systems are the non-deterministic Boolean dynamical systems and universality means the greatest in the sense of the inclusion. The paper gives four definitions of symmetry of these systems in a slightly…

Other Computer Science · Computer Science 2013-07-23 Serban E. Vlad

We present the concept of the topological symmetry group as a way to analyze the symmetries of non-rigid molecules. Then we characterize all of the groups which can occur as the topological symmetry group of an embedding of the complete…

Geometric Topology · Mathematics 2015-03-13 Dwayne Chambers , Erica Flapan , John D. O'Brien

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

Logic · Mathematics 2015-12-11 Andreas Blass , Mauro Di Nasso

All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

We study graded symmetric algebras, which are the symmetric monoids in the monoidal category of vector spaces graded by a group. We show that a finite dimensional graded semisimple algebra is graded symmetric. The center of a symmetric…

Rings and Algebras · Mathematics 2017-07-24 Sorin Dascalescu , Constantin Nastasescu , Laura Nastasescu

We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…

Representation Theory · Mathematics 2024-10-29 Matthew Fayers , Lucia Morotti

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

Symbolic Computation · Computer Science 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

Representation Theory · Mathematics 2013-02-19 Inneke Van Gelder , Gabriela Olteanu

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2009-04-17 Ferran Cedo , Eric Jespers , Jan Okninski

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor
‹ Prev 1 3 4 5 6 7 10 Next ›