Related papers: Large Shadows from Sparse Inequalities
The 2-dimensional Lyness map is a 5-periodic birational map of the plane which may famously be resolved to give an automorphism of a log Calabi-Yau surface, given by the complement of an anticanonical pentagon of $(-1)$-curves in a del…
A conjecture of Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy says that in every $2$-coloring of the edges of the complete $k$-uniform hypergraph $K_n^k$, there are two disjoint monochromatic loose paths of distinct colors such that they cover all…
The shadow of a black hole or a collapsing star is of great importance as we can extract important properties of the object and of the surrounding spacetime from the shadow profile. It can also be used to distinguish different types of…
A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough…
Let $X$ be a compact connected Riemann surface of genus $g$, with $g\geq 2$, and ${\cal M}_{\xi}$ a smooth moduli space of fixed determinant semistable vector bundles of rank $n$, with $n\geq 2$, over $X$. Take a smooth anticanonical…
We study the shadows of the fully non-linear, asymptotically flat Einstein-dilaton-Gauss-Bonnet (EdGB) black holes (BHs), for both static and rotating solutions. We find that, in all cases, these shadows are smaller than for comparable Kerr…
An $n\times n\times\dots\times n$ hypercube is made from $n^d$ unit hypercubes. Two unit hypercubes are neighbours if they share a $(d-1)$-dimensional face. In each step of a dismantling process, we remove a unit hypercube that has…
We answer a question of Gy\'arf\'as and S\'ark\"ozy from 2013 by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of different colours. We also give a lower bound for the…
Our goal in this paper is to find a characterization of $n$-dimensional bilinear Hardy inequalities \begin{align*} \bigg\| \,\int_{B(0,\cdot)} f \cdot \int_{B(0,\cdot)} g \,\bigg\|_{q,u,(0,\infty)} & \leq C \, \|f\|_{p_1,v_1,{\mathbb R}^n}…
An edge weighting problem of a graph G is an assignment of an integer weight to each edge e. Based on edge weighting problem, several types of vertex-coloring problems are put forward. A simple observation illuminates that edge weighting…
The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the…
For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…
In this note, we establish the 2-D Quantum Inequalities - first proved by Flanagan - for all CFTs with a causal holographic dual. Following the treatment of Kelly \& Wall, we establish that the Boundary Causality Condition in an asymptotic…
In this paper, we employ a ray-tracing algorithm to simulate the shadows of three equal-mass black holes in static equilibrium across a wide parameter space. We find that the shadows consist of a larger primary shadow and several distorted,…
Recently, Alon, Cambie, and Kang introduced asymmetric list coloring of bipartite graphs, where the size of each vertex's list depends on its part. For complete bipartite graphs, we fix the list sizes of one part and consider the resulting…
A locally irregular multigraph is a multigraph whose adjacent vertices have distinct degrees. The locally irregular edge coloring is an edge coloring of a multigraph $G$ such that every color induces a locally irregular submultigraph of…
The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…
For a graph $G$, we define its great shadow $S(G)$ as a construction that duplicates each vertex $v$ in $G$ and sets this duplicated vertex adjacent to $v$ and all neighbors of $v$. Great graph shadows arise naturally in the routing of…
The expansion of a graph is typically associated with its spectral properties - testing whether a graph is an expander is usually done using Cheeger's inequality. One can also use multiple eigenvalues in a higher-order Cheeger's inequality…
Nitrogen, the most abundant element in Earth's atmosphere, exists as a diatomic gas under standard temperature and pressure. In the two-dimensional (2D) limit, atomically thin nitrogen, termed nitrogene, has been theoretically predicted to…