English
Related papers

Related papers: Packing Disks into Disks with Optimal Worst-Case D…

200 papers

Different ways of the determination of masses of galactic disks, based on the kinematic data, are briefly discussed. The analysis of the rotation curves which reach maximum inside of a disk, and N-body modeling, reproducing the rotation…

Astrophysics · Physics 2007-05-23 A. V. Zasov , A. V. Khoperskov , N. V. Tyurina

We investigate, by "a la Marcinkiewicz" techniques applied to the (asymptotic) density function, how dense systems of equal spheres of $\rb^{n}, n \geq 1,$ can be partitioned at infinity in order to allow the computation of their density as…

Metric Geometry · Mathematics 2008-12-10 Gilbert Muraz , Jean-Louis Verger-Gaugry

The quantity of dust in a spiral disk can be estimated using the dust's typical emission or the extinction of a known source. In this paper, we compare two techniques, one based on emission and one on absorption, applied on sections of…

A polygonal curve $P$ with $n$ vertices is $c$-packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius $r$ is at most $cr$, for any $r>0$. Similarly, the concept of $c$-packedness can be…

Computational Geometry · Computer Science 2022-02-04 Sepideh Aghamolaei , Vahideh Keikha , Mohammad Ghodsi , Ali Mohades

Recent work by Pringle and by Maloney, Begelman & Pringle has shown that geometrically thin, optically thick, accretion disks are unstable to warping driven by radiation torque from the central source. In this paper we generalize the study…

Astrophysics · Physics 2009-10-30 Philip R. Maloney , Mitchell C. Begelman , Michael A. Nowak

We consider ternary disc packings of the plane, i.e. the packings using discs of three different radii. Packings in which each ''hole'' is bounded by three pairwise tangent discs are called triangulated. There are 164 pairs $(r,s)$,…

Computational Geometry · Computer Science 2022-11-08 Thomas Fernique , Daria Pchelina

The problem of covering random points in a plane with sets of a given shape has several practical applications in communications and operations research. One especially prominent application is the coverage of randomly-located points of…

Computational Geometry · Computer Science 2022-09-01 Christophter Thron , Anthony Moreno

The notion of a completely saturated packing [Fejes Toth, Kuperberg and Kuperberg, Highly saturated packings and reduced coverings, Monats. Math. 125 (1998) 127-145] is a sharper version of maximum density, and the analogous notion of a…

Metric Geometry · Mathematics 2014-11-11 Greg Kuperberg

Define the superball with radius $r$ and center ${\boldsymbol 0}$ in $\mathbb{R}^n$ to be the set $$ \left\{{\boldsymbol x}\in\mathbb{R}^n:\sum_{j=1}^{m}\left(x_{k_j+1}^2+x_{k_j+2}^2+\cdots+x_{k_{j+1}}^2\right)^{p/2}\leq…

Metric Geometry · Mathematics 2022-06-22 Chengfei Xie , Gennian Ge

We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…

Metric Geometry · Mathematics 2008-03-03 Tom Kennedy

In this paper I review and discuss the basic concepts of accretion disks, focused especially on the case of accretion disks around black holes. The well known alpha-model is revisited, showing the strengths and weaknesses of the model.…

High Energy Astrophysical Phenomena · Physics 2015-05-15 Matias Montesinos

The pinwheel problem is a real-time scheduling problem that asks, given $n$ tasks with periods $a_i \in \mathbb{N}$, whether it is possible to infinitely schedule the tasks, one per time unit, such that every task $i$ is scheduled in every…

Data Structures and Algorithms · Computer Science 2026-03-18 Ahan Mishra

The collapse of interstellar gaseous clouds towards a protostar leads to the formation of accretion disks around the central star. Such disks can be dynamically stable if they settle in an axisymmetric state. In this letter, we investigate…

Solar and Stellar Astrophysics · Physics 2020-09-07 Florian Ragossnig , Lukas Gehrig , Ernst A. Dorfi , Daniel Steiner , Alexander Stökl

This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…

Computational Complexity · Computer Science 2026-05-01 Angshul Majumdar

We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…

Metric Geometry · Mathematics 2018-07-11 Lewis Bowen , Charles Holton , Charles Radin , Lorenzo Sadun

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Metric Geometry · Mathematics 2019-11-07 Fernando Mário de Oliveira Filho , Frank Vallentin

We consider the density of two-dimensional critical percolation clusters, constrained to touch one or both boundaries, in infinite strips, half-infinite strips, and squares, as well as several related quantities for the infinite strip. Our…

Disordered Systems and Neural Networks · Physics 2007-06-22 Jacob J. H. Simmons , Peter Kleban , Kevin Dahlberg , Robert M. Ziff

In the past years a wealth of observations allowed to unravel the structural properties of the Dark Matter Halos around spirals. First, their rotation curves follow an Universal profile (URC) that can be described in terms of an exponential…

Astrophysics · Physics 2016-08-30 Paolo Salucci

The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…

Number Theory · Mathematics 2024-04-17 Edon Kelmendi

In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…

Metric Geometry · Mathematics 2011-01-19 Veit Elser
‹ Prev 1 8 9 10 Next ›