相关论文: Multiplicative and Exponential Variations of Ortho…

In this paper, for n a positve integer, we compute the number of n degree representations for a dihedral group G of order 2m, m \geq 3 and the dimensions of the corresponding spaces of G invariant bilinear forms over a complex field C. We…

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…

Let $l\in \mathbb{N}_{\geq 1}$ and $\alpha : \mathbb{Z}^l\rightarrow \text{Aut}(\mathscr{N})$ be an action of $\mathbb{Z}^l$ by automorphisms on a compact nilmanifold $\mathscr{N}$. We assume the action of every $\alpha(z)$ is ergodic for…

For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.

Let $E = \cup_{j = 1}^l [a_{2j-1},a_{2j}],$ $a_1 < a_2 < ... < a_{2l},$ $l \geq 2$ and set ${\boldmath$\omega$}(\infty) =(\omega_1(\infty),...,\omega_{l-1}(\infty))$, where $\omega_j(\infty)$ is the harmonic measure of $[a_{2 j - 1}, a_{2…

The orthogonal groups are a series of simple Lie groups associated to symmetric bilinear forms. There is no analogous series associated to symmetric trilinear forms. We introduce an infinite dimensional group-like object that can be viewed…

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.

We prove that mean multiplicities in the length spectrum of a non-compact arithmetic hyperbolic orbifold of dimension $n \geqslant 4$ have exponential growth rate $$ \langle g(L) \rangle \geqslant c \frac{e^{([n/2] - 1)L}}{L^{1 + \delta_{5,…

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…

Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a…

We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…

The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

Let $p^k m^2$ be an odd perfect number with special prime $p$. In this article, we provide an alternative proof for the biconditional that $\sigma(m^2) \equiv 1 \pmod 4$ holds if and only if $p \equiv k \pmod 8$. We then give an application…

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…