scholarly journals Generalized Alcuin's Sequence

10.37236/2796 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Daniel Panario ◽  
Murat Sahin ◽  
Qiang Wang
Keyword(s):  
Positive Integer ◽  
Generating Function ◽  
Recurrence Equation ◽  
Linear Recurrence ◽  
Fixed Integer ◽  
New Family ◽  
Special Case

We introduce a new family of sequences $\{t_k(n)\}_{n=-\infty}^{\infty}$ for given positive integer $k$. We call these new sequences asgeneralized Alcuin's sequences because we get Alcuin's sequence which has several interesting properties when $k=3$. Also, $\{t_k(n)\}_{n=0}^{\infty}$ counts the number of partitions of $n-k$ with parts being $k, \left(k-1\right), 2\left(k-1\right),$ $3\left(k-1\right)$, $\ldots, \left(k-1\right)\left(k-1\right)$. We find an explicit linear recurrence equation and the generating function for $\{t_k(n)\}_{n=-\infty}^{\infty}$. For the special case $k=4$ and $k=5$, we get a simpler formula for $\{t_k(n)\}_{n=-\infty}^{\infty}$ and investigate the period of $\{t_k(n)\}_{n=-\infty}^{\infty}$ modulo a fixed integer. Also, we get a formula for $p_{5}\left(n\right)$ which is the number of partitions of $n$ into exactly $5$ parts.

scholarly journals The AND/OR Theorem for Perceptrons

1992 ◽  
Vol 53 (1) ◽  
pp. 1-8
Author(s):  
I. D. Bruce ◽  
D. Easdown
Keyword(s):  
Positive Integer ◽  
Special Case

AbstractMinsky and Papert claim that, for any positive integer n, there exist predicates of order 1 whose conjunction and disjunction have order greater than n. Their proof is amended and a stronger result obtained of which their claim is a special case.

scholarly journals Characterizations and Identities for Isosceles Triangular Numbers

2021 ◽  
Vol 14 (2) ◽  
pp. 380-395
Author(s):  
Jiramate Punpim ◽  
Somphong Jitman
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Triangular Numbers ◽  
Triangular Number ◽  
Recursive Formulas ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

Triangular numbers have been of interest and continuously studied due to their beautiful representations, nice properties, and various links with other figurate numbers. For positive integers n and l, the nth l-isosceles triangular number is a generalization of triangular numbers defined to be the arithmetic sum of the formT(n, l) = 1 + (1 + l) + (1 + 2l) + · · · + (1 + (n − 1)l).In this paper, we focus on characterizations and identities for isosceles triangular numbers as well as their links with other figurate numbers. Recursive formulas for constructions of isosceles triangular numbers are given together with necessary and sufficient conditions for a positive integer to be a sum of isosceles triangular  numbers. Various identities for isosceles triangular numbers are established. Results on triangular numbers can be viewed as a special case.

scholarly journals The extended odd family of probability distributions with practice to a submodel

Filomat ◽  
2019 ◽  
Vol 33 (12) ◽  
pp. 3855-3867 ◽  
Author(s):  
Hassan Bakouch ◽  
Christophe Chesneau ◽  
Muhammad Khan
Keyword(s):  
Heavy Tails ◽  
Maximum Likelihood Method ◽  
Probability Distributions ◽  
Likelihood Method ◽  
Tuning Parameter ◽  
Data Sets ◽  
New Family ◽  
Rate Functions ◽  
Special Case ◽  
Family Of Distributions

In this paper, we introduce a new family of distributions extending the odd family of distributions. A new tuning parameter is introduced, with some connections to the well-known transmuted transformation. Some mathematical results are obtained, including moments, generating function and order statistics. Then, we study a special case dealing with the standard loglogistic distribution and the modifiedWeibull distribution. Its main features are to have densities with flexible shapes where skewness, kurtosis, heavy tails and modality can be observed, and increasing-decreasing-increasing, unimodal and bathtub shaped hazard rate functions. Estimation of the related parameters is investigated by the maximum likelihood method. We illustrate the usefulness of our extended odd family of distributions with applications to two practical data sets.

scholarly journals Statistics on Lattice Walks and q-Lassalle Numbers

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Lenny Tevlin
Keyword(s):  
Positive Integer ◽  
Generating Function ◽  
Catalan Numbers ◽  
Binomial Coefficients ◽  
Integer Coefficients ◽  
Major Index ◽  
Lattice Walks ◽  
International Audience ◽  
The Difference ◽  
Positive Integers

International audience This paper contains two results. First, I propose a $q$-generalization of a certain sequence of positive integers, related to Catalan numbers, introduced by Zeilberger, see Lassalle (2010). These $q$-integers are palindromic polynomials in $q$ with positive integer coefficients. The positivity depends on the positivity of a certain difference of products of $q$-binomial coefficients.To this end, I introduce a new inversion/major statistics on lattice walks. The difference in $q$-binomial coefficients is then seen as a generating function of weighted walks that remain in the upper half-plan. Cet document contient deux résultats. Tout d’abord, je vous propose un $q$-generalization d’une certaine séquence de nombres entiers positifs, liés à nombres de Catalan, introduites par Zeilberger (Lassalle, 2010). Ces $q$-integers sont des polynômes palindromiques à $q$ à coefficients entiers positifs. La positivité dépend de la positivité d’une certaine différence de produits de $q$-coefficients binomial.Pour ce faire, je vous présente une nouvelle inversion/major index sur les chemins du réseau. La différence de $q$-binomial coefficients est alors considérée comme une fonction de génération de trajets pondérés qui restent dans le demi-plan supérieur.

An Enumeration Problem Related to the Number of Labelled Bi-Coloured Graphs

1961 ◽  
Vol 13 ◽  
pp. 217-220 ◽  
Author(s):  
C. Y. Lee
Keyword(s):  
Positive Integer ◽  
Explicit Expression ◽  
Generating Function ◽  
Finite Sets ◽  
Enumeration Problem ◽  
Ordered Pairs

We will consider the following enumeration problem. Let A and B be finite sets with α and β elements in each set respectively. Let n be some positive integer such that n ≦ αβ. A subset S of the product set A × B of exactly n distinct ordered pairs (ai, bj) is said to be admissible if given any a ∈ A and b ∈ B, there exist elements (ai, bj) and (ak, bl) (they may be the same) in S such that ai = a and bl = b. We shall find here a generating function for the number N(α, β n) of distinct admissible subsets of A × B and from this generating function, an explicit expression for N(α, β n). In obtaining this result, the idea of a cut probability is used. This approach in a problem of enumeration may be of interest.

scholarly journals A New Family of Discrete Distributions with Mathematical Properties, Characterizations, Bayesian and Non-Bayesian Estimation Methods

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1648
Author(s):  
Mohamed Aboraya ◽  
Haitham M. Yousof ◽  
G.G. Hamedani ◽  
Mohamed Ibrahim
Keyword(s):  
Bayesian Estimation ◽  
Generating Function ◽  
Bayesian Methods ◽  
Probability Generating Function ◽  
Real Data ◽  
Discrete Distributions ◽  
Estimation Methods ◽  
Squared Error Loss Function ◽  
New Family ◽  
Mathematical Properties

In this work, we propose and study a new family of discrete distributions. Many useful mathematical properties, such as ordinary moments, moment generating function, cumulant generating function, probability generating function, central moment, and dispersion index are derived. Some special discrete versions are presented. A certain special case is discussed graphically and numerically. The hazard rate function of the new class can be “decreasing”, “upside down”, “increasing”, and “decreasing-constant-increasing (U-shape)”. Some useful characterization results based on the conditional expectation of certain function of the random variable and in terms of the hazard function are derived and presented. Bayesian and non-Bayesian methods of estimation are considered. The Bayesian estimation procedure under the squared error loss function is discussed. Markov chain Monte Carlo simulation studies for comparing non-Bayesian and Bayesian estimations are performed using the Gibbs sampler and Metropolis–Hastings algorithm. Four applications to real data sets are employed for comparing the Bayesian and non-Bayesian methods. The importance and flexibility of the new discrete class is illustrated by means of four real data applications.

scholarly journals Identities Involving the Fourth-Order Linear Recurrence Sequence

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1476 ◽  
Author(s):  
Lan Qi ◽  
Zhuoyu Chen
Keyword(s):  
Power Series ◽  
Series Expansion ◽  
Generating Function ◽  
Fourth Order ◽  
Power Series Expansion ◽  
Linear Recurrence ◽  
Recurrence Sequence ◽  
Order Linear ◽  
Elementary Methods ◽  
Linear Recurrence Sequence

In this paper, we introduce the fourth-order linear recurrence sequence and its generating function and obtain the exact coefficient expression of the power series expansion using elementary methods and symmetric properties of the summation processes. At the same time, we establish some relations involving Tetranacci numbers and give some interesting identities.

scholarly journals Finite Groups Which Admit An Automorphism With Few Orbits

1960 ◽  
Vol 12 ◽  
pp. 73-100 ◽  
Author(s):  
Daniel Gorenstein
Keyword(s):  
Abelian Group ◽  
Direct Product ◽  
Finite Groups ◽  
Study Groups ◽  
Quaternion Group ◽  
Fixed Integer ◽  
Fixed Element ◽  
Odd Order ◽  
Special Case

In the course of investigating the structure of finite groups which have a representation in the form ABA, for suitable subgroups A and B, we have been forced to study groups G which admit an automorphism ϕ such that every element of G lies in at least one of the orbits under ϕ of the elements g, gϕr(g), gϕrϕ(g)ϕ2r(g), gϕr(g)ϕr2r(g)ϕ3r(g), etc., where g is a fixed element of G and r is a fixed integer.In a previous paper on ABA-groups written jointly with I. N. Herstein (4), we have treated the special case r = 0 (in which case every element of G can be expressed in the form ϕi(gj)), and have shown that if the orders of ϕ and g are relatively prime, then G is either Abelian or the direct product of an Abelian group of odd order and the quaternion group of order 8.

scholarly journals A lower bound for a remainder term associated with the sum of digits function

1991 ◽  
Vol 34 (1) ◽  
pp. 121-142 ◽  
Author(s):  
D. M. E. Foster
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Upper Bound ◽  
Remainder Term ◽  
Fixed Integer ◽  
Sum Of Digits ◽  
Sum Of Digits Function ◽  
The Difference

For a fixed integer q≧2, every positive integer k = Σr≧0ar(q, k)qr where each ar(q, k)∈{0,1,2,…, q−1}. The sum of digits function α(q, k) Σr≧0ar(q, k) behaves rather erratically but on averaging has a uniform behaviour. In particular if , where n>1, then it is well known that A(q, n)∼½((q − 1)/log q)n logn as n → ∞. For odd values of q, a lower bound is now obtained for the difference 2S(q, n) = A(q, n)−½(q − 1))[log n/log q, where [log n/log q] denotes the greatest integer ≦log n /log q. This complements an upper bound already found.

Paradox of the class of all grounded classes

1953 ◽  
Vol 18 (2) ◽  
pp. 114-114 ◽  
Author(s):  
Shen Yuting
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Image Position ◽  
Special Case

A class A for which there is an infinite progression of classes A1, A2, … (not necessarily all distinct) such thatis said to be groundless. A class which is not groundless is said to be grounded. Let K be the class of all grounded classes.Let us assume that K is a groundless class. Then there is an infinite progression of classes A1, A2, … such thatSince A1 ϵ K, A1 is a grounded class; sinceA1 is also a groundless class. But this is impossible.Therefore K is a grounded class. Hence K ϵ K, and we haveTherefore K is also a groundless class.This paradox forms a sort of triplet with the paradox of the class of all non-circular classes and the paradox of the class of all classes which are not n-circular (n a given natural number). The last of the three includes as a special case the paradox of the class of all classes which are not members of themselves (n = 1).More exactly, a class A1 is circular if there exists some positive integer n and classes A2, A3, …, An such thatFor any given positive integer n, a class A1 is n-circular if there are classes A2, …, An, such thatQuite obviously, by arguments similar to the above, we get a paradox of the class of all non-circular classes and a paradox of the class of all classes which are not n-circular, for each positive integer n.

Sign in / Sign up

Export Citation Format

Share Document