Results 61 to 70 of about 863,417 (323)
Padovan numbers as sums over partitions into odd parts
Recently it was shown that the Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. In this paper, we introduce a similar representation for the Padovan numbers. As a corollary, we derive
Cristina Ballantine, Mircea Merca
doaj +1 more source
A generalisation of two partition theorems of Andrews [PDF]
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur’s celebrated partition identity (1926). Andrews’ two generalisations of Schur’s theorem went on to become two of the most influential results in ...
Jehanne Dousse
doaj +1 more source
Approximately Sampling Elements with Fixed Rank in Graded Posets
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for counting and ...
Bhakta, Prateek+3 more
core +1 more source
Assessing the Ecological Value: Monetizing Process Innovations in Tailored Forming
This article introduces a method for evaluating the sustainability of innovations, even with limited data. The method is illustrated through an analysis of the “Tailored Forming” technology, which explores the impact of sustainability on economic value added.
Jonas Schneider+4 more
wiley +1 more source
Arc Spaces and Rogers-Ramanujan Identities [PDF]
Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan Identities.
Clemens Bruschek+2 more
doaj +1 more source
AROUND THE ERDÖS–GALLAI CRITERION
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
On the Singularity of Random Bernoulli Matrices— Novel Integer Partitions and Lower Bound Expansions [PDF]
We prove a lower bound expansion on the probability that a random ±1 matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second most likely, and so on,
R. Arratia, S. Desalvo
semanticscholar +1 more source
2D Borophene: In‐Plane Hyperbolic Polaritons in the Visible Spectral Range
Researchers have synthesized the χ3 phase of borophene, a 2D metal, using chemical vapor deposition. Combining theory and deep‐subwavelength spectroscopy, they uncover borophene's unique anisotropic optical behavior in the visible range. This breakthrough paves the way for advanced optoelectronic devices using borophene‐based heterostructures ...
Yaser Abdi+5 more
wiley +1 more source
On Partitions and Arf Semigroups
In this study we examine some combinatorial properties of the Arf semigroup. In previous work, the author and Karakaş, Gümüşbaş defined an Arf partition of a positive integer n. Here, we continue this work and give new results on Arf partitions.
Tutaş Nesrin
doaj +1 more source
A statistical mechanical approach to restricted integer partition functions
The main aim of this paper is twofold: (1) Suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions --- a way of writing an integer as a sum ...
Dai, Wu-Sheng, Zhou, Chi-Chun
core +1 more source