English
Related papers

Related papers: $\pi$-formulas and Gray code

200 papers

In this paper we study periodic continued radicals of 2. We show that any periodic continued radicals of 2 converges to 2sin(q\pi), for some rational number q depends on the continued radical. Furthermore we show that if r_n is a periodic…

Number Theory · Mathematics 2013-04-23 Jayantha Senadheera

We give a characterization of common zeros of a sequence of univariate polynomials $W_n(z)$ defined by a recurrence of order two with polynomial coefficients, and with $W_0(z)=1$. Real common zeros for such polynomials with real…

Combinatorics · Mathematics 2017-12-13 David G. L. Wang , Dannielle D. D. Jin

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Computational Complexity · Computer Science 2017-10-10 Pranjal Dutta , Nitin Saxena , Amit Sinhababu

We present a simple recurrent formula to generate the Machin-like expression for calculating $\pi/4$. The method works for any denominator in the starting term and always provides a finite decomposition. We show that the terms in the…

General Mathematics · Mathematics 2024-03-18 Oleg S. Alferov

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-03-21 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Solé

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-01-10 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Sole

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

Classical Analysis and ODEs · Mathematics 2020-03-02 David G. L. Wang , Jerry J. R. Zhang

In paper I of this series we gave positive formulae for expanding the product $\mathfrak S^\pi \mathfrak S^\rho$ of two Schubert polynomials, in the case that both $\pi,\rho$ had shared descent set of size $\leq 3$. Here we introduce and…

Combinatorics · Mathematics 2023-06-27 Allen Knutson , Paul Zinn-Justin

Based on the generic construction of linear codes, we construct linear codes over the ring $\Bbb Z_4$ via posets of the disjoint union of two chains. We determine the Lee weight distributions of the quaternary codes. Moreover, we obtain…

Information Theory · Computer Science 2019-10-29 Xiaomeng Zhu , Yansheng Wu , Qin Yue

We construct a family of two-Lee-weight codes over the ring $R_k,$ which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain…

Information Theory · Computer Science 2016-12-19 Minjia Shi , Yue Guan

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

Combinatorics · Mathematics 2023-08-08 Édouard Bonnet , Romain Bourneuf , Colin Geniet , Stéphan Thomassé

We propose a simple uniform lower bound on the spacings between the successive zeros of the Laguerre polynomials $L_n^{(\alpha)}$ for all $\alpha>-1$. Our bound is sharp regarding the order of dependency on $n$ and $\alpha$ in various…

Classical Analysis and ODEs · Mathematics 2014-06-24 Stephane Chretien , Sebastien Darses

The study of Locally Checkable Labelings (LCLs) has led to a remarkably precise characterization of the distributed time complexities that can occur on bounded-degree trees. A central feature of this complexity landscape is the existence of…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-17 Gustav Schmid

We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.

History and Overview · Mathematics 2011-02-18 Svante Janson

Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a Gray map $\Phi:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $\Phi(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover,…

Information Theory · Computer Science 2009-07-31 J. Borges , C. Fernandez-Cordoba , J. Rifa

We derive interesting arctangent identities involving the golden ratio, Fibonacci numbers and Lucas numbers. Binary BBP-type formulas for the arctangents of certain odd powers of the golden ratio are also derived, for the first time in the…

Number Theory · Mathematics 2016-03-22 Kunle Adegoke

Hitherto only a base 5 BBP-type formula is known for $\sqrt 5\log\phi$, where \mbox{$\phi=(\sqrt 5+1)/2$}, the golden ratio, ( i.e. Formula 83 of the April 2013 edition of Bailey's Compendium of \mbox{BBP-type} formulas). In this paper we…

Number Theory · Mathematics 2016-03-16 Kunle Adegoke

In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…

Classical Analysis and ODEs · Mathematics 2017-07-18 Subuhi Khan , Mahvish Ali

We introduce a shifted version of the binomial theorem, and use it to study some remarkable trigonometric integrals and their explicit rewriting in terms of binomial multiple sums. Motivated by the expressions of area generating functions…

Mathematical Physics · Physics 2020-10-23 Stéphane Ouvry , Alexios P. Polychronakos

By using the Renormalization Group Equations in Chiral Perturbation Theory, one can calculate the double chiral logs that appear at two loops in any matrix element. We calculate them in the $\pi \pi$ scattering amplitude, where they…

High Energy Physics - Phenomenology · Physics 2009-10-28 Gilberto Colangelo
‹ Prev 1 3 4 5 6 7 10 Next ›