Results 91 to 100 of about 863,417 (323)

Modelling smurfing patterns in cryptocurrencies with integer partitions

IET Blockchain
In this paper, we propose the modelling of patterns of financial transactions ‐ with a focus on the domain of cryptocurrencies ‐ as splittings and present a method for generating such splittings utilizing integer partitions.
Marlene Koelbing, Klaus Kieseberg, Ceren Çulha, Bernhard Garn, Dimitris E. Simos   +4 more
doaj   +1 more source

Efficient calculation of the number of partitions of the set into subsets satisfying

Mathematics Open
Consider the set [Formula: see text]. We are interested in determining the number of partitions of this set into subsets of three elements each, where the sum of two of the elements equals the third.
Christian Hercher, Frank Niedermeyer
doaj   +1 more source

Derivatives are essentially integer partitions

Discrete Mathematics, 2000
The author presents a new proof of Faà di Bruno's formula expressing the \(n\)th derivative of the composition of 2 functions in terms of the derivatives of each function. Instead of the usual approach of exponential generating functions, he introduces a matrix notation that simplifies derivatives and relates them to integer partitions.
openaire   +2 more sources

Non‐Hermitian Topological Lattice Photonics: An Analytic Perspective

Advanced Photonics Research, EarlyView.
This review establishes exact analytical solutions for non‐Hermitian Hatano–Nelson, Su–Schrieffer–Heeger, and generalized Rice–Mele models. We demonstrate non‐Hermitian skin effects via point‐gap topology, hybrid skin‐topological edge states in 2D lattices, and spin‐polarized boundary modes governed by dual bulk‐boundary correspondence.
Shihua Chen, Abdul Basit, Lingfang Li, Chong Hou, Yang Ruan, Yating Wei, Zhenhua Ni   +6 more
wiley   +1 more source

Probabilities as Values of Modular Forms and Continued Fractions

International Journal of Mathematics and Mathematical Sciences, 2009
We consider certain probability problems which are naturally related to integer partitions. We show that the corresponding probabilities are values of classical modular forms.
Riad Masri, Ken Ono
doaj   +1 more source

Counting monster potentials

Journal of High Energy Physics, 2021
We study the large momentum limit of the monster potentials of Bazhanov-Lukyanov-Zamolodchikov, which — according to the ODE/IM correspondence — should correspond to excited states of the Quantum KdV model.
Riccardo Conti, Davide Masoero
doaj   +1 more source

Edges in the poset of partitions of an integer

Journal of Combinatorial Theory, Series A, 1988
Let \(P_ n\) be the poset of partitions of n, ordered by refinement. The author counts the number NE(n,t) of edges in the Hasse diagram of \(P_ n\) between rank levels t and t-1. He presents the recursion formula \[ NE(n,t)=NE(n-1,t)+NE(t+1,2t-n+1). \]
openaire   +3 more sources

Exploring Phonon Interference: Insights From a Nano‐Scale Silicon Double Slit Atomistic Simulation

Advanced Theory and Simulations, EarlyView.
Classical Waves at the Atomic Scale: Molecular Dynamics Reveal Phonon Interference in Silicon Nanostructures. Abstract In this study, the classic double‐slit experiment, originally developed for light waves is successfully adapted, to investigate the behavior of phonons in crystalline silicon.
Efstratios Nikidis, Paul Desmarchelier, Yoshiaki Nakamura, Anne Tanguy, Konstantinos Termentzidis, Joseph Kioseoglou   +5 more
wiley   +1 more source

ON GENERATING FUNCTIONS FOR RESTRICTED PARTITIONS OF RATIONAL INTEGERS [PDF]

, 1955
Charles Nicol, H. S. Vandiver
openalex   +2 more sources

Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions

Theory and Applications of Graphs
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj   +1 more source