相关论文: Large Shadows from Sparse Inequalities
It is shown that if a $d$-dimensional cube is decomposed into n cubes, the side lengths of which belong to the interval $\left(1-\frac{1}{n^{1/d}+1}, 1\right], then $n$ is a perfect $d$-th power and all cubes are of the same size. This…
A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…
Two-dimensional (2D) materials have garnered significant attention due to their unique properties and broad application potential. Building on the success of goldene, a monolayer lattice of gold atoms, we explore its proposed silver and…
We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every…
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions…
An equitable coloring of a graph is a proper coloring where the sizes of any two distinct color classes differ by at most one. The celebrated Chen-Lih-Wu Conjecture (CLWC for short) states that every connected graph $G$ that is neither an…
The Fibonacci cube $\Gamma_n$ is is the graph whose vertices are independent subsets of the path graph of length $n$, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klav\v{z}ar…
We prove that for $d>1$ the best information ratio of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $d/2$. Using the technique developed, we also prove that the information ratio of the…
A $d$-angulation of a surface is an embedding of a 3-connected graph on that surface that divides it into $d$-gonal faces. A $d$-angulation is said to be Gr\"unbaum colorable if its edges can be $d$-colored so that every face uses all $d$…
We study a 5d gravity theory with a warped metric and show that two N = 2 supersymmetric quantum-mechanical systems are hidden in the 4d spectrum. The supersymmetry can be regarded as a remnant of higher-dimensional general coordinate…
In the context of Twin Higgs models, we study a simple mechanism that simultaneously generates asymmetries in the dark and visible sector through the out-of-equilibrium decay of a TeV scale particle charged under a combination of baryon and…
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…
A shadowed polyhedron is a simple polyhedron equipped with half integers on regions, called gleams, which represents a compact, oriented, smooth 4-manifold. The polyhedron is embedded in the 4-manifold and it is called a shadow of that…
We present designs of 2D isotropic, disordered photonic materials of arbitrary size with complete band gaps blocking all directions and polarizations. The designs with the largest gaps are obtained by a constrained optimization method that…
We study the shadow cast by rotating black holes surrounded by plasma in the context of the 4D Einstein-Gauss-Bonnet theory of gravity. The metric for these black holes results from applying the Newman-Janis algorithm to a spherically…
A necklace splitting theorem of Goldberg and West asserts that any k-colored (continuous) necklace can be fairly split using at most k cuts. Motivated by the problem of Erd\H{o}s on strongly nonrepetitive sequences, Alon et al. proved that…
Problems, related to the determination of the minimal number of balls that generate a shadow at a fixed point in the multi-dimensional Euclidean space $ \mathbb{R}^n $, are considered in present work. Here, the statement "a system of balls…
In this paper, we investigate the validity of the Unique Games Conjecture when the constraint graph is the boolean hypercube. We construct an almost optimal integrality gap instance on the Hypercube for the Goemans-Williamson semidefinite…
This article documents my journey down the rabbit hole, chasing what I have come to know as a particularly unyielding problem in Ramsey theory on the integers: the $2$-Large Conjecture. This conjecture states that if $D \subseteq…
We use Lyapunov type functions to find conditions of finite shadowing in a neighborhood of a nonhyperbolic fixed point of a one-dimensional or two-dimensional homeomorphism or diffeomorphism. A new concept of shadowing in which we control…