Related papers: On the Area of Hypercube Layouts
Hypergraphs are a useful abstraction for modeling multiway relationships in data, and hypergraph clustering is the task of detecting groups of closely related nodes in such data. Graph clustering has been studied extensively, and there are…
The pairing symmetry in infinite-layer nickelate superconductors has been an intriguing problem under heated debates. In this work, we study a two-orbital Hubbard model with one strongly correlated $3d$ orbital and one more itinerant $5d$…
We have used electron and neutron powder diffraction to elucidate the structural properties of superconducting \NaD. Our measurements show that our superconducting sample exhbits a number of supercells ranging from ${1/3}a^{*}$ to…
For finite graphs, path-width is an interesting and useful concept, but if we extend it to infinite graphs in the most obvious way (by making the indexing path infinite), it does not work nicely. The simplest extension that works nicely is…
In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is…
The two-dimensional Hubbard model is studied for small values of the interaction strength (U of the order of the hopping amplitude t), using a variational ansatz well suited for this regime. The wave function, a refined Gutzwiller ansatz,…
Geodesic regular tree structures are essential to combat numerical precision issues that arise while working with large-scale computational hyperbolic geometry and have applications in algorithms based on distances in such tessellations. We…
Within a Green's function formalism we calculate the electronic structure around static extended magnetic and non-magnetic perturbations in a d-wave superconductor. In partucular, we discuss recent elastic neutron scattering and scanning…
We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and…
A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…
We consider a periodic lattice structure in $d=2$ or $3$ dimensions with unit cell comprising $Z$ thin elastic members emanating from a similarly situated central node. A general theoretical approach provides an algebraic formula for the…
We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…
An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$…
In a recent paper [1] we showed that N=1 supersymmetric QCD in the presence of certain superpotential deformations has a rich landscape of supersymmetric and non-supersymmetric vacua. In this paper we embed this theory in string theory as a…
We consider a model for complex networks that was recently proposed as a model for complex networks by Krioukov et al. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are connected if they are at…
It has been shown that the $n$-dimensional unit hypercube contains an $n$-dimensional regular simplex of edge length $c\sqrt n$ for arbitrary $c<1/2$ if $n$ is sufficiently large (Maehara, Ruzsa and Tokushige, 2009). We prove the same…
We analyze the response of a type II superconducting wire to an external magnetic field parallel to it in the framework of Ginzburg-Landau theory. We focus on the surface superconductivity regime of applied field between the second and…