Results 11 to 20 of about 1,022,967 (317)
Physical Review E, 2002 We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via simulation in d ...
Dodds, Peter Sheridan, Weitz, Joshua S.
core +5 more sources
Frontiers in Physics, 2021 Identical hard spheres in cylindrical confinement exhibit a rich variety of densest-packed columnar structures. Such structures, which generally vary with the corresponding cylinder-to-sphere diameter ratio D, serve as structural models for a variety of ...
Panpan Ma, Ho-Kei Chan
doaj +1 more source
Starch-based Active Packaging Film and its Application
BioResources, 2023 Montmorillonite (MMT) was used to improve the performance of starch and nano-ZnO was added to act as antibacterial agent for developing a starch-based active packaging material via solution mixing and casting methods.
Xingya Kang +4 more
doaj +2 more sources
Toward Wojda's conjecture on digraph packing [PDF]
Opuscula Mathematica, 2017 Given a positive integer \(m\leq n/2\), Wojda conjectured in 1985 that if \(D_1\) and \(D_2\) are digraphs of order \(n\) such that \(|A(D_1)|\leq n-m\) and \(|A(D_2)|\leq 2n-\lfloor n/m\rfloor-1\) then \(D_1\) and \(D_2\) pack.
Jerzy Konarski, Andrzej Żak
doaj +1 more source
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miyazawa, F.K., Wakabayashi, Y.
openaire +1 more source
Constructing subspace packings from other packings [PDF]
Linear Algebra and its Applications, 2021 The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an orthonormal basis (the so-called tightness condition) and the geometric constraint that the subspaces form an ...
openaire +3 more sources
Packing Graphs: The Packing Problem Solved [PDF]
The Electronic Journal of Combinatorics, 1996 For every fixed graph $H$, we determine the $H$-packing number of $K_n$, for all $n > n_0(H)$. We prove that if $h$ is the number of edges of $H$, and $gcd(H)=d$ is the greatest common divisor of the degrees of $H$, then there exists $n_0=n_0(H)$, such that for all $n > n_0$, $$ P(H,K_n)=\lfloor {{dn}\over{2h}} \lfloor {{n-1}\over{d}} \rfloor ...
Caro, Yair, Yuster, Raphael
openaire +2 more sources
COMPACT: Concurrent or Ordered Matrix-Based Packing Arrangement Computation Technique
Applied Sciences, 2021 Despite their versatility in treating irregular geometries, the raster methods have received limited attention in solving packing problems involving rotatable objects.
Gokhan Serhat
doaj +1 more source
Nature Communications, 2018 Organic luminogens with persistent room temperature phosphorescence (RTP) have attracted great attention for their wide applications in optoelectronic devices and bioimaging.
Jie Yang +10 more
semanticscholar +1 more source
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stevens, Brett, Mendelsohn, Eric
openaire +1 more source