Related papers: Odd Vector Cycles in $\mathbb{Z}^m$

In this article, we consider a family of elliptic curves defined by $E_{m}: y^2= x^3 -m^2 x + (pqr)^2 $ where $m $ is a positive integer and $p, q, ~\text{and}~ r$ are distinct odd primes and study the torsion as well the rank of…

The Hamming oracle returns the Hamming distance between an unknown binary $n$-vector $x$ and a binary query $n$-vector y. The objective is to determine $x$ uniquely using a sequence of $m$ queries. What are the minimum number of queries…

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

For a non-negative integer $m$, let $S(m)$ denote the sum given by $$S(m):=\sum_{n=0}^{m}\frac{(-1)^n(8n+1)}{n!^3}\left(\frac{1}{4}\right)_n^3.$$ Using the powerful WZ-method, for a prime $p\equiv 3$ $($mod $4)$ and an odd integer $r>1$, we…

A $k$-query locally decodable code (LDC) $C$ allows one to encode any $n$-symbol message $x$ as a codeword $C(x)$ of $N$ symbols such that each symbol of $x$ can be recovered by looking at $k$ symbols of $C(x)$, even if a constant fraction…

Let $R$ be a standard graded algebra over an infinite field $\mathbb{K}$ and $M$ a finitely generated $\ZZ$-graded $R$-module. Let $I_1,\ldots I_m$ be graded ideals of $R$. The functions $r(M/I_1^{a_1}\ldots I_m^{a_m}M)$ and…

It is proved that, for all odd integer $s \geqslant s_0(\varepsilon)$, there are at least $\big( c_0 - \varepsilon \big) \frac{s^{1/2}}{(\log s)^{1/2}} $ many irrational numbers among the following odd zeta values:…

We prove moderate deviations bounds for the lower tail of the number of odd cycles in a $\calG(n, m)$ random graph. We show that the probability of decreasing triangle density by $t^3$, is $\exp(-\Theta(n^2 t^2))$ whenever $n^{-3/4} \ll t^3…

Let $\rho(G)$ denote the number of convex cycles of a simple graph G of order n, size m, and girth 3 <= g <=n. It is proved that $\rho(G) \leq \frac{n}{g}(m-n+1)$ and that equality holds if and only if G is an even cycle or a Moore graph.…

For non-negative integers $r$ and $m$, let $S_m^{(r)}(n)$ denote the $r$-fold summation (or hyper-sum) over the first $n$ positive integers to the $m$th powers, with the initial condition $S_m^{(0)}(n) =n^m$. In this paper, we derive a new…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

A "signed graph" is a graph $\Gamma$ where the edges are assigned sign labels, either "$+$" or "$-$". The sign of a cycle is the product of the signs of its edges. Let $\mathrm{SpecC}(\Gamma)$ denote the list of lengths of cycles in…

We study the class number one problem for real quadratic fields $\mathbb{Q}(\sqrt{9m^2+ 4m})$, where $m$ is an odd integer. We show that for $m \equiv 1 \pmod 3$ there is only one such field with class number one and only one such field…

I show here that there are three different kinds of iterations for the reduced Collatz algorithm; depending on whether the root of the number is odd or even. There is only one kind of iteration if the root is odd and two kinds if the root…

Let $k,l,m$ be integers and $r(k,l,m)$ be the minimum integer $N$ such that for any red-blue-green coloring of $K_{N,N}$, there is a red matching of size at least $k$ in a component, or a blue matching of at least size $l$ in a component,…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…

Let $T$ be a tournament of odd order $n\ge 5,$ $c_{m}(T)$ be the number of its $m$-cycles, and $s_{m}(T)$ be the number of its strongly connected $m$-subtournaments. Due to work of L.W. Beineke and F. Harary, it is well known that…

We solve the Symmetrized Principal Minor Assignment Problem, that is we show how to determine if for a given vector $v\in \mathbb{C}^{n}$ there is an $n\times n$ matrix that has all $i\times i$ principal minors equal to $v_{i}$. We use a…

Consider the $m$-th roots of unity in {\bf C}, where $m>0$ is an integer. We address the following question: For what values of $n$ can one find $n$ such $m$-th roots of unity (with repetitions allowed) adding up to zero? We prove that the…