相关论文: Large Shadows from Sparse Inequalities
We describe a two-dimensional optical lattice for ultracold atoms with spatial features below the diffraction limit created by a bichromatic optical standing wave. At every point in space these fields couple the internal atomic states in a…
We study the intersection statistics of affine subspaces in the hypercube $\mathbb{F}_2^n$, motivated by recent work of Alon, Axenovich, and Goldwasser on the intersection statistics of axis-aligned subcubes of an $n$-dimensional cube. Let…
Let n denote the number of variables and m the number of equations in a sparse polynomial system over the binary field. We study the inconsistency probability of randomly generated sparse polynomial systems over the binary field, where each…
For a graph $G$, its \emph{cubicity} $cub(G)$ is the minimum dimension $k$ such that $G$ is representable as the intersection graph of (axis--parallel) cubes in $k$--dimensional space. Chandran, Mannino and Oriolo showed that for a…
The monopole systems with hidden symmetry of the two-dimensional Coulomb problem are considered. One of them, the "charge-charged magnetic vortex" with a half-spin, is constructed by reducing the quantum circular oscillator with respect to…
This paper studies two classical inequalities, namely the Hausdorff-Young inequality and equal-exponent Young's convolution inequality, for discrete functions supported in the binary cube $\{0,1\}^d\subset\mathbb{Z}^d$. We characterize the…
The discovery of graphene and other two-dimensional (2-D) materials has stimulated a general interest in low-dimensional (low-D) materials. Whereas long time ago, Peierls and Landau's theoretical work demonstrated that any one- and…
Isoperimetric inequalities have been studied since antiquity, and in recent decades they have been studied extensively on discrete objects, such as the hypercube. An important special case of this problem involves bounding the size of the…
Let $D$ denote a positive integer and let $Q_D$ denote the graph of the $D$-dimensional hypercube. Let $X$ denote the vertex set of $Q_D$ and let $A \in \MX$ denote the adjacency matrix of $Q_D$. A matrix $B \in \MX$ is called $A$-{\em…
Seeking singularity free solutions are important for further understanding black holes in quantum level. Recently, a five-dimensional singularity free black hole/topological star was constructed [Phys. Rev. Lett. 126, 151101 (2021)].…
We investigate the qualitative features of binary black hole shadows using the model of two extremally charged black holes in static equilibrium (a Majumdar--Papapetrou solution). Our perspective is that binary spacetimes are natural…
We prove a minimum degree version of the Kruskal--Katona theorem: given $d\ge 1/4$ and a triple system $F$ on $n$ vertices with minimum degree at least $d\binom n2$, we obtain asymptotically tight lower bounds for the size of its shadow.…
We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…
A result of Gy\'arf\'as exactly determines the size of a largest monochromatic component in an arbitrary $r$-coloring of the complete $k$-uniform hypergraph $K_n^k$ when $k\geq 2$ and $r-1\leq k\leq r$. We prove a result which says that if…
We have investigated the shadow of a Konoplya-Zhidenko rotating non-Kerr black hole with an extra deformation parameter. The spacetime structure arising from the deformed parameter affects sharply the black hole shadow. With the increase of…
A fundamental problem in computer vision is that of inferring the intrinsic, 3D structure of the world from flat, 2D images of that world. Traditional methods for recovering scene properties such as shape, reflectance, or illumination rely…
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…
In any CAT(k) space M, the "shadow" of a tangent vector Z at a point p is the set vectors that form an angle of \pi or more with Z. Taking logarithm maps at points approaching p along a fixed geodesic ray from p with tangent Z collapses the…
This paper studies the problem of 3D volumetric reconstruction from two views of a scene with an unknown camera. While seemingly easy for humans, this problem poses many challenges for computers since it requires simultaneously…