English
Related papers

Related papers: The ranks of alternating string C-groups

200 papers

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. For integers $n>k>0 $, the shift graph $G(n,k)$ is the graph whose vertex set…

Combinatorics · Mathematics 2026-05-25 Suchanda Roy , Ramesh Hariharasubramanian

C*-categories are essentially norm-closed *-categories of bounded linear operators between Hilbert spaces. The purpose of this work is to identify suitable axioms defining Krein C*-categories, i.e. those categories that play the role of…

Operator Algebras · Mathematics 2011-12-30 Paolo Bertozzini , Kasemsun Rutamorn

We classify rank one 2-representations of SL2, GL2 and SO3 web categories. The classification is inspired by similar results about quantum groups, given by reducing the problem to the classification of bilinear and trilinear forms, and is…

Representation Theory · Mathematics 2026-04-07 Daniel Tubbenhauer

We prove there is no ring with unit group isomorphic to S_n for n \geq 5 and that there is no ring with unit group isomorphic to A_n for n \geq 5, n \neq 8. We give examples of rings with unit groups isomorphic to S_1, S_2, S_3, S_4, A_1,…

Rings and Algebras · Mathematics 2015-02-02 Christopher Davis , Tommy Occhipinti

Let $G=A_n$, a finite alternating group. We study the commuting graph of $G$ and establish, for all possible values of $n$ barring $13, 14, 17$ and $19$, whether or not the independence number is equal to the clique-covering number.

Group Theory · Mathematics 2015-10-21 Daniel Barrantes , Nick Gill , Jeremías Ramírez

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…

Group Theory · Mathematics 2024-02-21 Mark L. Lewis , Quanfu Yan

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

Group Theory · Mathematics 2020-05-05 Nanying Yang , Alexey Staroletov

Two characteristic-dependent linear rank inequalities are given for eight variables. Specifically, the first inequality holds for all finite fields whose characteristic is not three and does not in general hold over characteristic three.…

Information Theory · Computer Science 2021-02-09 Randall Dougherty , Eric Freiling , Kenneth Zeger

We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…

Operator Algebras · Mathematics 2015-05-15 Caleb Eckhardt , Paul McKenney

Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…

Combinatorics · Mathematics 2026-01-28 Carmelo Cisto , Raquel Tapia-Ramos

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

Number Theory · Mathematics 2021-05-28 Jianya Liu , Lilu Zhao

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

We classify all finite groups with five relative commutativity degrees. Also, we give a partial answer to our previous conjecture on a lower bound of the number of relative commutativity degrees of finite groups.

Group Theory · Mathematics 2019-12-11 Mohammad Farrokhi Derakhshandeh Ghouchan

We study linear and hermitian representations of finite $C_2$-graded groups. We prove that the category of linear representations is equivalent to a category of antilinear representations as an $\infty$-category. We also prove that the…

Representation Theory · Mathematics 2021-08-30 Dmitriy Rumynin , James Taylor

Let A be a unital maximal full algebra of operator fields with base space the k-cube [0,1]^k and fibre algebras, say, {A_t}_{t \in [0,1]^k}. Then the stable rank of A is bounded above by the supremum of the stable ranks sr(C([0,1]^k)…

Operator Algebras · Mathematics 2007-05-23 Ping Wong Ng , Takahiro Sudo

We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…

Combinatorics · Mathematics 2017-09-01 Jannik Silvanus , Jens Vygen

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

Group Theory · Mathematics 2013-01-30 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

The number of conjugate classes of derangements of order $n$ is the same as the number $h(n)$ of the restricted partitions with every portion greater than $1$. It is also equal to the number of isotopy classes of $2\times n$ Latin…

Combinatorics · Mathematics 2022-05-24 Wen-Wei Li , Zhong-Lin Cheng , Jia-Bao Liu

We consider N=1 supersymmetric U(N), SO(N), and Sp(N) gauge theories, with two-index tensor matter and added tree-level superpotential, for general breaking patterns of the gauge group. By considering the string theory realization and…

High Energy Physics - Theory · Physics 2008-11-26 Ken Intriligator , Per Kraus , Anton V. Ryzhov , Masaki Shigemori , Cumrun Vafa

In [1], whether a target binary string s can be represented from a boolean formula with operands chosen from a set of binary strings W was studied. In this paper, we first examine selecting a maximum subset X from W, so that for any string…

Computational Complexity · Computer Science 2012-01-17 Peng Zhang