Results 21 to 30 of about 791,112 (289)

Generalized Andrásfai Graphs

Discussiones Mathematicae - General Algebra and Applications, 2022
In this paper, we introduce a new family of circulants GA(t, k), called Generalized Andrásfai graphs, where t, k ≥ 2 are integers. We study various parameters like diameter, girth, domination number etc. of GA(t, k).
Biswas Sucharita, Das Angsuman, Saha Manideepa   +2 more
doaj   +1 more source

Density and O-density of Beurling generalized integers [PDF]

, 1988
Let π(x) and N(x) be the respective counting functions of a set of generalized primes and a set of generalized integers in Beurling's sense. We consider weak conditions on π(x) some of which yield N(x) ∼ cx for some positive c, and some of which yield ...
Zhang, Wen-Bin
core   +1 more source

Lifted generalized permutahedra and composition polynomials [PDF]

Discrete Mathematics & Theoretical Computer Science, 2012
We introduce a "lifting'' construction for generalized permutohedra, which turns an $n$-dimensional generalized permutahedron into an $(n+1)$-dimensional one.
Federico Ardila, Jeffrey Doker
doaj   +1 more source

There are no multiply-perfect Fibonacci numbers [PDF]

, 2011
Here, we show that no Fibonacci number (larger than 1) divides the sum of its ...
Lewis, Ryan H., Togbe, Alain, Kevin A. Broughan, Huguet, V. Janitzio Mejia, Marcos J. González, Broughan, Kevin A., Luca, Florian, V. Janitzio Mejía Huguet, Ryan H. Lewis, Alain Togbé, Gonzalez, Marcos J., Florian Luca   +11 more
core   +1 more source

Some sums related to the terms of generalized Fibonacci autocorrelation sequences

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2017
In this paper, we give the terms of the generalized Fibonacci autocorrelation sequences defined as and some interesting sums involving terms of these sequences for an odd integer number and nonnegative integers.
Neşe Ömür , Sibel Koparal
doaj   +1 more source

Stability for delayed generalized 2D discrete logistic systems

Advances in Difference Equations, 2004
This paper is concerned with delayed generalized 2D discrete logistic systems of the form xm+1,n=f(m,n,xm,n,xm,n+1,xm−σ,n−τ) , where σ and τ are positive integers, f:ℕ02×ℝ3→ℝ is a real function, which ...
Guanrong Chen, Chuan Jun Tian
doaj   +2 more sources

A one line factoring algorithm [PDF]

, 2012
We describe a variant of Fermat’s factoring algorithm which is competitive with SQUFOF in practice but has heuristic run time complexity O(n1/3) as a general factoring algorithm.
William B. Hart, Hart, William B.
core   +1 more source

A Generalization of Conjugation of Integer Partitions

The Electronic Journal of Combinatorics
We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts of a partition divisible by $s$, whereas the second counts the number of cells in the Ferrers diagram of a ...
Seamus P. Albion, Theresia Eisenkölbl, Ilse Fischer, Moritz Gangl, Hans Höngesberg, Christian Krattenthaler, Martin Rubey   +6 more
openaire   +4 more sources

Identities of Symmetry for Higher-Order Generalized q-Euler Polynomials

Abstract and Applied Analysis, 2014
We investigate the properties of symmetry in two variables related to multiple Euler q-l-function which interpolates higher-order q-Euler polynomials at negative integers.
D. V. Dolgy, D. S. Kim, T. G. Kim, J. J. Seo   +3 more
doaj   +1 more source

Fast Random Integer Generation in an Interval [PDF]

ACM Transactions on Modeling and Computer Simulation, 2019
In simulations, probabilistic algorithms, and statistical tests, we often generate random integers in an interval (e.g., [0, s )). For example, random integers in an interval are essential to the Fisher-Yates random shuffle.
openaire   +4 more sources