Related papers: Divisibility among power GCD and power LCM matrice…

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…

The coprime commutators $\gamma_j^*$ and $\delta_j^*$ were recently introduced as a tool to study properties of finite groups that can be expressed in terms of commutators of elements of coprime orders. They are defined as follows. Let $G$…

Let $G$ be a finite group and denote by $o(g)$ the order of an element $g\in G$. We say that $G$ is an $LCM$-group if $o(x^ny)$ is a divisor of the least common multiple of $o(x^n)$ and $o(y)$ for all $x, y\in G$ and $n\in\mathbb{N}$. This…

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(x_1g)\cdot\ldots\cdot(x_lg)$ where $g\in G$ and $x_1, \ldots, x_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…

We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…

We present an optimization procedure for a seminal class of positive maps $\tau_{n,k}$ in the algebra of $n \times n$ complex matrices introduced and studied by Tanahasi and Tomiyama, Ando, Nakamura and Osaka. Recently, these maps were…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is…

We compute the class of a divisor on M_{g,n} given as the closure of the locus of smooth pointed curves [C; x_1,..., x_n] for which \sum d_j x_j has an effective representative, where d_j are integers summing up to g-1, not all positive.…

Over a smooth complex projective curve $C$ of genus $g$ let $\M (n,d)$ be the moduli space of semistable bundles of rank $n$ and degree $d$ on $C$, and $\SM (n,L)$, the moduli space of those bundles whose determinant is isomorphic to a…

Let $x_1,...,x_n$ be a list of real numbers, let $s :=\sum_{i=1}^{n}x_i$ and let $h:\mathbb{N} \rightarrow \mathbb{R}$ be a function. We gave a necessary and sufficient condition for $s>h(n)$ (respectively, $s<h(n)$). Let $G=(V,E)$ be a…

We give a relatively short proof of one of the central cases of the main theorem from the paper "The distribution of integers with a divisor in a given interval", math.NT/0401223. Namely, we determine the order of magnitude of the number of…

Variables of separation for classical $GL(3)$ magnetic chain obtained by Sklyanin form a generic positive divisor $D$ of degree $n$ on a genus $g$ non-hyperelliptic algebraic curve. Because $n>g$ this divisor $D$ has unique representative…

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors…

Description of adjoint invariants of general Linear Lie superalgebras $\mathfrak{gl}(m|n)$ by Kantor and Trishin is given in terms of supersymmetric polynomials. Later, generators of invariants of the adjoint action of the general linear…

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…