English
Related papers

Related papers: On the Area of Hypercube Layouts

200 papers

As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…

Statistics Theory · Mathematics 2020-02-17 Anatoly Zhigljavsky , Jack Noonan

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

Social and Information Networks · Computer Science 2016-11-17 Alexander P. Kartun-Giles , Orestis Georgiou , Carl P. Dettmann

We investigate the role of connection density in an adaptive network model of chaotic units that dynamically rewire based on their internal states and local coherence. By systematically varying the network's connectivity density, we uncover…

Adaptation and Self-Organizing Systems · Physics 2025-08-19 Ramiro Plüss , Pablo Martín Gleiser

We show how to calculate semi-analytically the dense vortex state in strong type-II superconducting nanostructures. For the specific case of a strip, we find vortex lattice solutions which also incorporate surface superconductivity. We…

Superconductivity · Physics 2009-10-30 J. J. Palacios

Magnetic measurements carried out on MgB_2 superconducting round wires have shown that the critical current density J_c(B_a) in wires sheathed by iron can be significantly higher than that in the same bare (unsheathed) wires over a wide…

Superconductivity · Physics 2007-05-23 Alexey V. Pan , Shixue Dou

An $N$-superconcentrator is a directed, acyclic graph with $N$ input nodes and $N$ output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known…

Discrete Mathematics · Computer Science 2016-05-05 Vladimir Kolmogorov , Michal Rolinek

We have initiated the study of topology of the space of coverings on grid domains. The space has the following constraint: while all the covering agents can move freely (we allow overlapping) on the domain, their union must cover the whole…

General Topology · Mathematics 2013-12-31 Han Wang

Recent advances in hydrogen lithography on silicon surfaces now enable the fabrication of complex and error-free atom-scale circuitry. The structure of atomic wires, the most basic and common circuit elements, plays a crucial role at this…

Materials Science · Physics 2025-10-17 Max Yuan , Lucian Livadaru , Roshan Achal , Jason Pitters , Furkan Altincicek , Robert Wolkow

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

We develop a detailed analysis of electron transport in normal diffusive con- ductors in the presence of proximity induced superconductivity. A rich structure of temperature and energy dependencies for the system condcutcance, density of…

Condensed Matter · Physics 2007-05-23 A. D. Zaikin , F. K. Wilhelm , A. A. Golubov

In this paper, we study the problem of hyperball (hypersphere) packings in $n$-dimensional hyperbolic space ($n \ge 4$). We prove that to each $n$-dimensional congruent saturated hyperball packing, there is an algorithm to obtain a…

Metric Geometry · Mathematics 2025-06-16 Arnasli Yahya , Jenő Szirmai

We calculate the density of states of a layered superconductor in which there are two layers per unit cell. One of the layers contains a d-wave pairing interaction while the other is a normal metal. The goal of this article is to understand…

supr-con · Physics 2009-10-28 W. A. Atkinson , J. P. Carbotte

This paper focuses on curves and surfaces of constant width, with some additional results about general ovals. We emphasize the use of Fourier series to derive properties, some of which are known. Amongst other results, we show that the…

Differential Geometry · Mathematics 2015-04-28 Howard L. Resnikoff

This paper deals with the modelling of superconducting and resistive wires with a helicoidal symmetry, subjected to an external field and a transport current. Helicoidal structures are three-dimensional, and therefore yield computationally…

Let $G$ and $H$ be graphs, with $|V(H)|\geq |V(G)| $, and $f:V(G)\rightarrow V(H)$ a one to one map of their vertices. Let $dilation(f) = max\{ dist_{H}(f(x),f(y)): xy\in E(G) \}$, where $dist_{H}(v,w)$ is the distance between vertices $v$…

Combinatorics · Mathematics 2014-03-13 Zevi Miller , Dan Pritikin , I. H. Sudborough

Surface superconductivity is studied within Ginzburg-Landau theory for two classes of models for the order parameter of UPt$_{3}$. The first class assumes two independent one-dimensional order parameters ($AB$ models), while the second…

Condensed Matter · Physics 2009-10-28 Ding Chuan Chen , Anupam Garg

I propose a superconductivity model, which is based on the assumption that stripes in high-Tc cuprates (a) exist and (b) organize themselves in a two-dimensional superstructure. The model describes hole states, which are localized either…

Superconductivity · Physics 2007-05-23 Boris V. Fine

We show that every packing of congruent regular pentagons in the Euclidean plane has density at most $(5-\sqrt5)/3$, which is about 0.92. More specifically, this article proves the pentagonal ice-ray conjecture of Henley (1986), and…

Metric Geometry · Mathematics 2016-09-14 Thomas Hales , Wöden Kusner

We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making…

Combinatorics · Mathematics 2026-03-25 Pragnya Das

Consider networks on $n$ vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over source-destination pairs. Suppose journey times depend on both…

Statistical Mechanics · Physics 2007-05-23 David Aldous
‹ Prev 1 3 4 5 6 7 10 Next ›