中文
相关论文

相关论文: Large Shadows from Sparse Inequalities

200 篇论文

Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In…

组合数学 · 数学 2012-09-11 sarah-marie belcastro , Ruth Haas

We show that the vertices and edges of a $d$-dimensional grid graph $G=(V,E)$ ($d\geqslant 2$) can be labeled with the integers from $\{1,\ldots,\lvert V\rvert\}$ and $\{1,\ldots,\lvert E\rvert\}$, respectively, in such a way that for every…

组合数学 · 数学 2017-02-10 Rachel Wulan Nirmalasari Wijaya , Joe Ryan , Thomas Kalinowski

Given a palette of six colors, a colored cube is a cube where each face is colored with exactly one color and each color appears on some face. Starting with an arbitrary collection of unit length colored cubes, one can try to arrange a…

组合数学 · 数学 2015-03-26 Ethan Berkove , David Cervantes Nava , Daniel Condon , Rachel Katz

We investigate pairs of diagonal cubic equations with integral coefficients. For a class of such Diophantine systems with 11 or more variables, we are able to establish that the number of integral solutions in a large box is at least as…

数论 · 数学 2021-10-12 Joerg Bruedern , Trevor D. Wooley

We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any…

组合数学 · 数学 2023-06-23 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

组合数学 · 数学 2007-05-23 Michael Joswig , G"unter M. Ziegler

Metric of axially symmetric asymptotically flat black holes in an arbitrary metric theory of gravity can be represented in the general form which depends on infinite number of parameters. We constrain this general class of metrics by…

广义相对论与量子宇宙学 · 物理学 2021-05-20 R. A. Konoplya , A. Zhidenko

What does a black hole look like? In 1+3 spacetime dimensions, the optical appearance of a black hole is a bidimensional region in the observer's sky often called the black hole shadow, as supported by the EHT observations. In higher…

广义相对论与量子宇宙学 · 物理学 2024-10-10 João P. A. Novo , Pedro V. P. Cunha , Carlos A. R. Herdeiro

The distinguishing number of a graph G, denoted D(G), is the minimum number of colors such that there exists a coloring of the vertices of G where no nontrivial graph automorphism is color-preserving. In this paper, we show that the…

组合数学 · 数学 2007-05-23 Melody Chan

We define an analogue of the cube and an analogue of the 5-wedge in higher dimensions, each with $2d+2$ vertices and $d^2+2d-3$ edges. We show that these two are the only minimisers of the number of edges, amongst d-polytopes with $2d+2$…

组合数学 · 数学 2020-05-15 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…

组合数学 · 数学 2009-10-07 William Y. C. Chen , Larry X. W. Wang

Let $f: E \mapsto \{1,2,\dots,k\}$ be an edge coloring of the $n$ - dimensional hypercube $H_n$. By the palette at a vertex $v$ we mean the sequence $\left(f(e_1(v)), f(e_1(v)),\dots, f(e_n(v))\right)$, where $e_i(v)$ is the $i$ -…

组合数学 · 数学 2024-06-07 Anna Flaszczyńska , Aleksandra Gorzkowska , Mariusz Woźniak

We study the problem of partitioning the unit cube $[0,1]^n$ into $c$ parts so that each $d$-dimensional axis-parallel projection has small volume. This natural combinatorial/geometric question was first studied by Kopparty and Nagargoje…

计算复杂性 · 计算机科学 2024-10-30 Swastik Kopparty , Harry Sha

We investigate the shadow behaviors of the superentropic black holes in arbitrary dimensions. Using the Hamilton-Jacobi mechanism, we first obtain the associated null geodesic equations of motion. By help of a spheric stereographic…

高能物理 - 理论 · 物理学 2022-08-10 A. Belhaj , M. Benali , Y. Hassouni

In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…

组合数学 · 数学 2013-06-03 Sinisa Vrecica , Rade Zivaljevic

A digraph is {\em $d$-dominating} if every set of at most $d$ vertices has a common out-neighbor. For all integers $d\geq 2$, let $f(d)$ be the smallest integer such that the vertices of every 2-edge-colored (finite or infinite) complete…

组合数学 · 数学 2021-02-26 Louis DeBiasio , András Gyárfás

A black hole casts a shadow as an optical appearance because of its strong gravitational field. We study the shadow cast by the five-dimensional Myers-Perry black hole with equal rotation parameters. We demonstrate that the null geodesic…

广义相对论与量子宇宙学 · 物理学 2015-06-22 Uma Papnoi , Farruh Atamurotov , Sushant G. Ghosh , Bobomurat Ahmedov

Material's geometrical structure is a fundamental part of their properties. The honeycomb geometry of graphene is responsible for the arising of its Dirac cone, while the kagome and Lieb lattice hosts flat bands and pseudospin-1 Dirac…

材料科学 · 物理学 2021-04-21 F. Crasto de Lima , A. Fazzio

Answering a recent question of Patchell and Spiro, we show that when a $d$-dimensional cube of side length $n$ is filled with letters, the word $\mathsf{CAT}$ can appear contiguously at most $(3^{d-1}/2)n^d$ times (allowing diagonals); we…

组合数学 · 数学 2022-11-29 Noga Alon , Noah Kravitz

Inspired by the unique properties of graphene, the focus in the literature is now on investigations of various two-dimensional (2D) materials with the aim to explore their properties for future applications. The group IV analogues of…

材料科学 · 物理学 2020-03-24 J. Shah , H. M. Sohail , R. I. G. Uhrberg , W. Wang