Results 61 to 70 of about 56,399 (238)
$q$-DEFORMED RATIONALS AND $q$-CONTINUED FRACTIONS
We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the $q$-deformed Pascal
SOPHIE MORIER-GENOUD, VALENTIN OVSIENKO
doaj +1 more source
Polynomial sequences of binomial-type arising in graph theory [PDF]
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$ toroidal chessboard
Schneider, Jon
core
Calculation of some determinants using the s-shifted factorial
Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a generalization for
Abramowitz M +17 more
core +4 more sources
Random discrete probability measures based on a negative binomial process
Abstract A distinctive functional of the Poisson point process is the negative binomial process for which the increments are not independent but are independent conditional on an underlying gamma variable. Using a new point process representation for the negative binomial process, we generalize the Poisson–Kingman distribution and its corresponding ...
Sadegh Chegini, Mahmoud Zarepour
wiley +1 more source
In this paper, we derive two new generating functions of Laguerre-polynomials, which look like the negative binomial theorem for the Laguerre function Lnx, by adopting the bi-partite entangled state representation and the operator-Hermite-polynomial HnX ...
Ke Zhang, Hong-Yi Fan
doaj +1 more source
Free field primaries in general dimensions: counting and construction with rings and modules
We define lowest weight polynomials (LWPs), motivated by so(d, 2) representation theory, as elements of the polynomial ring over d × n variables obeying a system of first and second order partial differential equations.
Robert de Mello Koch, Sanjaye Ramgoolam
doaj +1 more source
Polynomial Functors of Modules [PDF]
We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise criterion for a ...
Harry Martinson Aniara +1 more
core
Restricted Tweedie stochastic block models
Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +1 more source
q-Analogue of a binomial coefficient congruence
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are positive integers.
W. Edwin Clark
doaj +1 more source
Binomial Thue equations and polynomial powers [PDF]
We explicitly solve a collection of binomial Thue equations with unknown degree and unknown S-unit coefficients, for a number of sets S of small cardinality. Equivalently, we characterize integers x such that the polynomial x 2 + x assumes perfect power values, modulo S-units. These results are proved through a combination of techniques, including Frey
Michael A. Bennett +3 more
openaire +2 more sources

