English
Related papers

Related papers: Counting Free Abelian Actions

200 papers

In this paper, we study cohomology rings and cohomological pairings over Abelian symplectic quotients of special Hamiltonian tori manifolds. The Hamiltonian group actions appear in quantum information theory where the tori are maximal tori…

Mathematical Physics · Physics 2016-10-31 Saeid Molladavoudi

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

Number Theory · Mathematics 2024-11-12 Zarullo Rakhmonov , Firuz Rakhmonov

We consider the problem of counting the number of rational points of bounded height in the zero-loci of Brauer group elements on semi-simple algebraic groups over number fields. We obtain asymptotic formulae for the counting problem for…

Number Theory · Mathematics 2018-10-09 Daniel Loughran , Ramin Takloo-Bighash , Sho Tanimoto

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Number Theory · Mathematics 2020-03-03 Zhi-Wei Sun

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

Combinatorics · Mathematics 2024-07-11 Yuewen Luo

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

Combinatorics · Mathematics 2007-05-23 E. Rodney Canfield , Herbert S. Wilf

This paper introduces a simple and computationally efficient algorithm for conversion formulae between moments and cumulants. The algorithm provides just one formula for classical, boolean and free cumulants. This is realized by using a…

Computation · Statistics 2008-11-21 E. Di Nardo , I. Oliva

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Combinatorics · Mathematics 2019-12-03 Patrick Bennett

We prove that if $G=(\mathbb{Z}/2)^r$ acts freely and cellularly on a finite-dimensional CW-complex $X$ homotopy equivalent to $\mathbb{R}P ^{n_1} \times \cdots \times \mathbb{R} P ^{n_k}$ with trivial action on the mod-$2$ cohomology, then…

Algebraic Topology · Mathematics 2025-06-05 Ergun Yalcin

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

In this paper we construct free Hom-semigroups when its unary operation is multiplicative and is an involution. Our method of construction is by bracketed words. As a consequence, we obtain free Hom-associative algebras generated by a set…

Rings and Algebras · Mathematics 2017-12-19 Li Guo , Shanghua Zheng

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

Group Theory · Mathematics 2023-10-16 André Carvalho

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

Associated to a finite graph $X$ is its quantum automorphism group $G(X)$. We prove a formula of type $G(X*Y)=G(X)*_wG(Y)$, where $*_w$ is a free wreath product. Then we discuss representation theory of free wreath products, with the…

Quantum Algebra · Mathematics 2007-08-30 Teodor Banica , Julien Bichon

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

Logic in Computer Science · Computer Science 2007-05-23 Martin Ziegler , Klaus Meer

We obtain an asymptotic formula for the number of ways to represent every reduced residue class as a product of a prime and square-free integer. This may be considered as a relaxed version of a conjecture of Erd\"os, Odlyzko, and…

Number Theory · Mathematics 2020-01-22 Kam Hung Yau

We compute the generating series for the simplest class of bi-free cumulants, beyond free cumulants, the two-bands bi-free cumulants of a pair of a left and a right variable. We also consider two-faced systems with a commutation condition…

Operator Algebras · Mathematics 2013-08-12 Dan-Virgil Voiculescu

We extend some of the results of Agler, Knese, and McCarthy [1] to $n$-tuples of commuting isometries for $n>2$. Let $\mathbb{V}=(V_1,\dots,V_n)$ be an $n$-tuple of a commuting isometries on a Hilbert space and let Ann$(\mathbb{V})$ denote…

Functional Analysis · Mathematics 2016-04-26 Edward J. Timko

We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…

Combinatorics · Mathematics 2017-10-19 Zhicheng Gao , Andrew MacFie , Qiang Wang

In this note we report the solution of the problem of defining the $S$-transform in Free Probability Theory in arbitrary dimensions. This is achieved by generalising the theory and embedding it into an algebraic-geometric framework.…

Representation Theory · Mathematics 2013-08-06 Roland M Friedrich , John McKay