English
Related papers

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

200 papers

For any complex vector bundle $E^k$ of rank $k$ over a manifold $M^m$ with Chern classes $c_i \in H^{2i}(M^m,\Z)$ and any non-negative integers $l_1, >..., l_k$ we show the existence of a positive number $N(k,m)$ and the existence of a…

Differential Geometry · Mathematics 2014-09-02 Hong-Van Le

We call an order $O$ in a quadratic field $K$ odd (resp. even) if its discriminant is an odd (resp. even) integer. We call an elliptic curve $E$ over the field $C$ of complex numbers with CM odd (resp. even) if its endomorphism ring…

Number Theory · Mathematics 2025-11-18 Yuri G. Zarhin

We prove that the order of the double reduced 2-factor transfer digraph ${\cal R}^{**}_{m}$ which is needed for the enumeration of the spanning unions of cycles in the rectangular grid graph $P_m \times P_n$ ($m,n \in N$), when $m$ is odd,…

Combinatorics · Mathematics 2023-08-09 Jelena Đokic

Let $\mathscr{G}_{\rm CM}(d)$ denote the collection of groups (up to isomorphism) that appear as the torsion subgroup of a CM elliptic curve over a degree $d$ number field. We completely determine $\mathscr{G}_{\rm CM}(d)$ for odd integers…

Number Theory · Mathematics 2016-01-05 Abbey Bourdon , Paul Pollack

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

General Mathematics · Mathematics 2019-10-18 Erhan Tezcan

Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…

Information Theory · Computer Science 2024-08-06 Xianhong Xie , Yaxin Zhao , Zhonghua Sun , Xiaobo Zhou

This article deals with the study of the number of limit cycles surrounding a critical point of a quadratic planar vector field, which, in normal form, can be written as $x'= a_1 x-y-a_3x^2+(2 a_2+a_5)xy + a_6 y^2$, $y'= x+a_1 y + a_2x^2+(2…

Classical Analysis and ODEs · Mathematics 2017-09-05 José Luis Bravo , Manuel Fernández , Ignacio Ojeda , Fernando Sánchez

The zero divisor graph of a commutative ring $R$ with unity is a graph whose vertices are the nonzero zero-divisors of the ring, with two distinct vertices being adjacent if their product is zero. This graph is denoted by $\Gamma(R)$. In…

Rings and Algebras · Mathematics 2026-05-19 Nabajit Talukdar

We propose tests for the null hypothesis that the law of a complex-valued random vector is circularly symmetric. The test criteria are formulated as $L^2$-type criteria based on empirical characteristic functions, and they are convenient…

Statistics Theory · Mathematics 2021-03-22 Norbert Henze , Pierre Lafaye de Micheaux , Simos G. Meintanis

Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash…

Combinatorics · Mathematics 2018-06-20 Lina Li , Theodore Molla

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

Combinatorics · Mathematics 2024-07-16 Rutger Campbell , J. Pascal Gollin , Kevin Hendrey , Raphael Steiner

An $r$-uniform linear cycle of length $\ell$, denoted by $C^r_{\ell}$, is an $r$-graph with $\ell$ edges $e_1,e_2,\dots,e_{\ell}$ where $e_i=\{v_{(r-1)(i-1)},v_{(r-1)(i-1)+1},\dots,v_{(r-1)i}\}$ (here $v_0=v_{(r-1)\ell}$). For $0<\delta<1$…

Combinatorics · Mathematics 2025-04-10 Lirong Deng , Jie Han , Jiaxi Nie , Sam Spiro

In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…

Rings and Algebras · Mathematics 2025-09-22 Seema Antil , Gurleen Kaur , Manju Khan

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Combinatorics · Mathematics 2016-04-01 Francesca Merola , Tommaso Traetta

Let $C_{m} : y^{2} = x^{3} - m^{2}x +p^{2}q^{2}$ be a family of elliptic curves over $\mathbb{Q}$, where $m$ is a positive integer and $p, q$ are distinct odd primes. We study the torsion part and the rank of $C_m(\mathbb{Q})$. More…

Number Theory · Mathematics 2022-01-04 Kalyan Chakraborty , Richa Sharma

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…

Combinatorics · Mathematics 2014-10-03 Jie Ma

A $\lambda K_v$ is a complete graph on $v$ vertices with $\lambda$ edges between each pair of the $v$ vertices. A $(\lambda+\mu)K_{v+u}-\lambda K_v$ is a $(\lambda+\mu)K_{v+u}$ with the edge set of $\lambda K_v$ removed. Decomposing a…

Combinatorics · Mathematics 2016-02-05 John Asplund

For any $m = 3 \left( 2n + 1 \right) with \ n \in \mathbb{N^*} ,$ the prime counting function $\pi(m) = 4 + \left \vert A_4(m) \right \vert + 2 \left \vert A_6(m) \right \vert $ where $A_6(m) $ and $ A_4(m) $ are the sets of Twin Primes and…

General Mathematics · Mathematics 2023-10-31 Patrice M. Okouma , Guillaume Hawing

Define the Ducci function $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ so \[D(x_1,x_2, ...,x_n)=(x_1+x_2 \;\text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m).\] Call $\{D^{\alpha}(\mathbf{u})\}_{\alpha=0}^{\infty}$ the…

Number Theory · Mathematics 2024-08-30 Mark L. Lewis , Shannon M. Tefft

To represent real $m$-dimensional vectors, a positional vector system given by a non-singular matrix $M \in \mathbb{Z}^{m \times m}$ and a digit set $\mathcal{D} \subset \mathbb{Z}^m$ is used. If $m = 1$, the system coincides with the well…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-20 Izabella Ingrid Farkas , Edita Pelantová , Milena Svobodová
‹ Prev 1 4 5 6 7 8 10 Next ›