English
Related papers

Related papers: On minimal easily computable dimension group algeb…

200 papers

Using a new powerful technique based on the notion of megaideal, we construct a complete set of inequivalent realizations of real Lie algebras of dimension no greater than four in vector fields on a space of an arbitrary (finite) number of…

Mathematical Physics · Physics 2014-11-18 Roman O. Popovych , Vyacheslav M. Boyko , Maryna O. Nesterenko , Maxim W. Lutfullin

We analyze definably compact groups in o-minimal expansions of ordered groups as a combination of semi-linear groups and groups definable in o-minimal expansions of real closed fields. The analysis involves structure theorems about their…

Logic · Mathematics 2012-02-28 Pantelis Eleftheriou , Ya'acov Peterzil

We give a number of examples of exotic actions of locally compact groups on separable nuclear C*-algebras. In particular, we give examples of the following: (1) Minimal effective actions of ${\mathbb{Z}}$ and $F_n$ on unital nonsimple prime…

Operator Algebras · Mathematics 2023-12-08 Eberhard Kirchberg , N. Christopher Phillips

We determine the isomorphism classes of semisimple Hopf algebras of dimension 60 which are simple as Hopf algebras.

Quantum Algebra · Mathematics 2009-11-26 Sonia Natale

We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…

Representation Theory · Mathematics 2014-11-24 Gabriela Olteanu , Inneke Van Gelder

We show that the dimension of the Cuntz semigroup of a C*-algebra is determined by the dimensions of the Cuntz semigroups of its separable sub-C*-algebras. This allows us to remove separability assumptions from previous results on the…

Operator Algebras · Mathematics 2021-03-25 Hannes Thiel , Eduard Vilalta

The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…

Group Theory · Mathematics 2026-02-06 Mihai Ivan

Sofic and hyperlinear groups are the countable discrete groups that can be approximated in a suitable sense by finite symmetric groups and groups of unitary matrices. These notions turned out to be very deep and fruitful, and stimulated in…

Group Theory · Mathematics 2015-05-06 Valerio Capraro , Martino Lupini

Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…

Commutative Algebra · Mathematics 2019-10-23 Manuel Gonzalez-Sarabia , Jose Martínez-Bernal , Rafael H. Villarreal , Carlos E. Vivares

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…

Information Theory · Computer Science 2013-09-09 Jian Gao , Linzhi Shen , Fang-Wei Fu

Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…

A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements. This…

Representation Theory · Mathematics 2011-04-05 Qunhua Liu , Dong Yang

Let $R$ be a commutative Noetherian ring and $D$ be a discrete Hodge algebra over $R$ of dimension $d>\text{dim}(R)$. Then we show that (i) the top Euler class group $E^d(D)$ of $D$ is trivial. (ii) if $d>\text{dim}(R)+1$, then $(d-1)$-st…

Commutative Algebra · Mathematics 2022-04-18 Manoj K. Keshari , Md. Ali Zinna

The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 ; or over even degree…

Information Theory · Computer Science 2013-02-12 Hugues Randriam , Lin Sok , Patrick Solé

Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…

Symbolic Computation · Computer Science 2026-05-07 Lucas Michel

A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…

Number Theory · Mathematics 2017-06-30 Maria Bras-Amorós

We produce a short and elementary algorithm to compute an upper bound for the canonical dimension of a spit semisimple linear algebraic group. Using this algorithm we confirm previously known bounds by Karpenko and Devyatov as well as we…

Algebraic Geometry · Mathematics 2021-08-19 Kirill Zainoulline

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

Mathematical Physics · Physics 2015-10-14 Rencai Lu , Kaiming Zhao

Through the means of an alternative and less algebraic method, an explicit expression for the isometry groups of the six-dimensional homogeneous nearly K\"ahler manifolds is provided.

Differential Geometry · Mathematics 2024-11-11 Mateo Anarella , Michaël Liefsoens

In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…

Information Theory · Computer Science 2024-06-21 Umberto Martínez-Peñas , Rubén Rodríguez-Ballesteros
‹ Prev 1 8 9 10 Next ›