Results 1 to 10 of about 361,091 (296)
Partitions of an Integer into Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results.
Matthieu Latapy
doaj +7 more sources
Congruences modulo prime for fractional colour partition function [PDF]
Arab Journal of Mathematical Sciences, 2023 Purpose – Let p[1,r;t] be defined by ∑n=0∞p[1,r;t](n)qn=(E1Er)t, where t is a non-zero rational number, r ≥ 1 is an integer and Er=∏n=0∞(1−qr(n+1)) for |q|
Riyajur Rahman, Nipen Saikia
doaj +1 more source
On Some Structural Properties of Integer-Based Graphs and Their Topological Indices
Journal of Mathematics, 2022 Integer partition plays an important role in different fields like graph theory and number theory. This paper comprises different properties of the integer partition-based graphs.
Faqir M. Bhatti +4 more
doaj +1 more source
A Measure-on-Graph-Valued Diffusion: A Particle System with Collisions and Its Applications
Mathematics, 2022 A diffusion-taking value in probability-measures on a graph with vertex set V, ∑i∈Vxiδi is studied. The masses on each vertex satisfy the stochastic differential equation of the form dxi=∑j∈N(i)xixjdBij on the simplex, where {Bij} are independent ...
Shuhei Mano
doaj +1 more source
AROUND THE ERDÖS–GALLAI CRITERION
Ural Mathematical Journal, 2023 By an (integer) partition we mean a non-increasing sequence \(\lambda=(\lambda_1, \lambda_2, \dots)\) of non-negative integers that contains a finite number of non-zero components. A partition \(\lambda\) is said to be graphic if there exists a graph \(G\
Vitaly A. Baransky, Tatiana A. Senchonok
doaj +1 more source
Some Special Integer Partitions Generated by a Family of Functions
Trends in Computational and Applied Mathematics, 2023 In this work, inspired by Ramanujan’s fifth order Mock Theta function f1(q), we define a collection of functions and look at them as generating functions for partitions of some integer n containing at least m parts equal to each one of the numbers from
M. L. Matte
doaj +1 more source
International Journal of Approximate Reasoning, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Seaweeds Arising from Brauer Configuration Algebras
Mathematics, 2023 Seaweeds or seaweed Lie algebras are subalgebras of the full-matrix algebra Mat(n) introduced by Dergachev and Kirillov to give an example of algebras for which it is possible to compute the Dixmier index via combinatorial methods.
Agustín Moreno Cañadas +1 more
doaj +1 more source
A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
Journal of Chemistry, 2022 In computer science and mathematics, a partition of a set into two or more disjoint subsets with equal sums is a well-known NP-complete problem. This is a hard problem and referred to as the partition problem or number partitioning.
M. Haris Mateen +4 more
doaj +1 more source
ON SEQUENCES OF ELEMENTARY TRANSFORMATIONS IN THE INTEGER PARTITIONS LATTICE
Ural Mathematical Journal, 2023 An integer partition, or simply, a partition is a nonincreasing sequence \(\lambda = (\lambda_1, \lambda_2, \dots)\) of nonnegative integers that contains only a finite number of nonzero components. The length \(\ell(\lambda)\) of a partition \(\lambda\
Vitaly A. Baransky, Tatiana A. Senchonok
doaj +1 more source