English
Related papers

Related papers: An extension of Lucas Theorem

200 papers

In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…

Complex Variables · Mathematics 2020-01-14 Trevor J. Richards

We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…

Geometric Topology · Mathematics 2023-06-05 Jerzy Dydak

We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of…

Logic in Computer Science · Computer Science 2013-06-13 Annabelle McIver , Tahiry Rabehaja , Georg Struth

We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.

Combinatorics · Mathematics 2020-08-12 Pankaj Jyoti Mahanta , Manjil P. Saikia

Here Euler notes the recursive relation for the general binomial coefficients, by assuming that (1+x)^a can be expanded in a power series.

History and Overview · Mathematics 2012-02-02 Leonhard Euler , Artur Diener , Alexander Aycock

We discuss $q$-analogues of the classical congruence $\binom{ap}{bp}\equiv\binom{a}{b}\pmod{p^3}$, valid for primes $p>3$, as well as its generalisations. In particular, we prove related congruences for ($q$-analogues of) integral factorial…

Number Theory · Mathematics 2019-12-16 Wadim Zudilin

The classical Gauss--Lucas theorem describes the location of the critical points of a polynomial. There is also a hyperbolic version, due to Walsh, in which the role of polynomials is played by finite Blaschke products on the unit disk. We…

Complex Variables · Mathematics 2019-09-04 Konstantin M. Dyakonov

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

Combinatorics · Mathematics 2019-05-07 Robert W. Donley,

Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…

Number Theory · Mathematics 2013-01-03 Romeo Mestrovic

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

Combinatorics · Mathematics 2013-02-12 Milan Janjic

In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev…

Classical Analysis and ODEs · Mathematics 2017-03-07 Pierluigi Vellucci , Alberto Maria Bersani

A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…

Combinatorics · Mathematics 2009-07-08 Milan Janjic

In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the…

Combinatorics · Mathematics 2020-05-26 Ilya D. Shkredov , Jozsef Solymosi

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

Information Theory · Computer Science 2015-10-05 Trygve Johnsen , Keisuke Shiromoto , Hugues Verdure

In this paper, we gave some properties of binomial coefficient.

Combinatorics · Mathematics 2017-01-24 Daniel Yaqubi , Madjid Mirzavaziri

We prove a $q$-analog of a classical binomial congruence due to Ljunggren which states that \[ \binom{a p}{b p} \equiv \binom{a}{b} \] modulo $p^3$ for primes $p\ge5$. This congruence subsumes and builds on earlier congruences by Babbage,…

Number Theory · Mathematics 2011-03-17 Armin Straub

We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} \chi (x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} \chi_1 (x)\chi_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for…

Number Theory · Mathematics 2014-10-27 Vincent Pigno , Christopher Pinner

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Information Theory · Computer Science 2014-10-15 Hugues Randriambololona

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

Classical Analysis and ODEs · Mathematics 2008-02-03 Anne de Médicis , Dennis W. Stanton

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

Combinatorics · Mathematics 2014-01-28 Mark Shattuck
‹ Prev 1 8 9 10 Next ›