Results 11 to 20 of about 868,385 (332)
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
The packing spectrum for Birkhoff averages on a self-affine repeller [PDF]
, 2010 We consider the multifractal analysis for Birkhoff averages of continuous potentials on a self-affine Sierpi\'{n}ski sponge. In particular, we give a variational principal for the packing dimension of the level sets.
Reeve, Henry WJ
core +1 more source
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
Understanding the Frequency Distribution of Mechanically Stable Disk Packings [PDF]
, 2006 Relative frequencies of mechanically stable (MS) packings of frictionless bidisperse disks are studied numerically in small systems. The packings are created by successively compressing or decompressing a system of soft purely repulsive disks, followed ...
Corey S. O’Hern +3 more
core +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
A Color Gamut Description Algorithm for Liquid Crystal Displays in CIELAB Space
The Scientific World Journal, 2014 Because the accuracy of gamut boundary description is significant for gamut mapping process, a gamut boundary calculating method for LCD monitors is proposed in this paper.
Bangyong Sun +3 more
doaj +1 more source
Calibration of Sliding Friction Coefficient in DEM between Different Particles by Experiment
Applied Sciences, 2023 Granular materials are widely prevalent in nature and industry, and the discrete element method (DEM) is the most effective method for the mechanical analysis of granular materials. Because of the difficulty inherent in friction coefficient determination,
Pengcheng Liu +9 more
doaj +1 more source