Results 31 to 40 of about 4,436 (299)
Boltzmann Complexity: An Emergent Property of the Majorization Partial Order
Boltzmann macrostates, which are in 1:1 correspondence with the partitions of integers, are investigated. Integer partitions, unlike entropy, uniquely characterize Boltzmann states, but their use has been limited.
William Seitz, A. D. Kirwan
doaj +1 more source
Gluing two affine Yangians of đ€đ©1
We construct a four-parameter family of affine Yangian algebras by gluing two copies of the affine Yangian of đ€đ©1. Our construction allows for gluing operators with arbitrary (integer or half integer) conformal dimension and arbitrary (bosonic or ...
Wei Li, Pietro Longhi
doaj +1 more source
A PROOF OF ANDREWSâ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES
Our main result establishes Andrewsâ conjecture for the asymptotic of the generating function for the number of integer partitions of $n$ without $k$ consecutive parts.
DANIEL M. KANE, ROBERT C. RHOADES
doaj +1 more source
Asymptotic prime partitions of integers [PDF]
In this paper, we discuss P(n), the number of ways a given integer n may be written as a sum of primes. In particular, an asymptotic form P-as(n) valid for n ->infinity is obtained analytically using standard techniques of quantum statistical mechanics. First, the bosonic partition function of primes, or the generating function of unrestricted prime
Bartel, Johann +3 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Engel, Konrad +2 more
openaire +2 more sources
Integer partitions and exclusion statistics [PDF]
We provide a combinatorial description of exclusion statistics in terms of minimal difference $p$ partitions. We compute the probability distribution of the number of parts in a random minimal $p$ partition. It is shown that the bosonic point $ p=0$ is a repulsive fixed point for which the limiting distribution has a Gumbel form.
Comtet, Alain +2 more
openaire +3 more sources
Hardware acceleration of number theoretic transform for zkâSNARK
An FPGAâbased hardware accelerator with a multiâlevel pipeline is designed to support the largeâbitwidth and largeâscale NTT tasks in zkâSNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly $k$-connected ...
Kai Wang
doaj +1 more source
Brauer configuration algebras are path algebras induced by appropriated multiset systems. Since their structures underlie combinatorial data, the general description of some of their algebraic invariants (e.g., their dimensions or the dimensions of their
AgustĂn Moreno Cañadas +2 more
doaj +1 more source
A Nekrasov-Okounkov type formula for affine $\widetilde{C}$ [PDF]
In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$.
Mathias Pétréolle
doaj +1 more source

