相关论文: Large Shadows from Sparse Inequalities

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…

Barnette identified two interesting classes of cubic polyhedral graphs for which he conjectured the existence of a Hamiltonian cycle. Goodey proved the conjecture for the intersection of the two classes. We examine these classes from the…

We present a general framework for engineering two-dimensional (2D) sub-wavelength topological optical lattices using spatially dependent atomic dark states in a $\Lambda$-type configuration of the atom-light coupling. By properly designing…

A proper vertex coloring of a graph is equitable if the sizes of all color classes differ by at most $1$. For a list assignment $L$ of $k$ colors to each vertex of an $n$-vertex graph $G$, an equitable $L$-coloring of $G$ is a proper…

We explore the characteristics of shadows for a general class of spherically symmetric, static spacetimes, which may arise in general relativity or in modified theories of gravity. The chosen line element involves a sum (with constant but…

Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…

Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…

We study the geometry and topology of immersed surfaces in Euclidean 3-space whose Gauss map satisfies a certain two-piece-property, and solve the ``shadow problem" formulated by H. Wente.

We extend the notion of a dyadic grid of cubes in Euclidean space to include infinite dyadic cubes. These `tops' of a dyadic grid form a tiling of Euclidean space which is subject to the constraints similar to those arising in tiling…

The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…

A phenomenon of "algebraic self-similarity" on 3d cubic lattice, providing what can be called an algebraic analogue of Kadanoff--Wilson theory, is shown to possess a 4d version as well. Namely, if there is a $4\times 4$ matrix $A$ whose…

We show that on the $d$-dimensional cube $I^d\equiv [0,1]^d$ the discrete moduli of smoothness which use only the values of the function on a diadic mesh are sufficient to determine the moduli of smoothness of that function. As an important…

Given a multigraph $G$ and a positive integer $t$, the distance-$t$ chromatic index of $G$ is the least number of colours needed for a colouring of the edges so that every pair of distinct edges connected by a path of fewer than $t$ edges…

We consider the following type of question: Given a partial proper $d$-edge coloring of the $d$-dimensional hypercube $Q_d$, and lists of allowed colors for the non-colored edges of $Q_d$,can we extend the partial coloring to a proper…

We study the property of matter in equilibrium with a static, spherically symmetric black hole in D-dimensional spacetime. It requires this kind of matter has an equation of state (\omega\equiv p_r/\rho=-1/(1+2kn), k,n\in \mathbb{N}), which…

The co-varying physical couplings (CPC) framework states that physical parameters like the speed of light in vacuum $c$, the Newtonian constant $G$, and the cosmological constant $\Lambda$ could indeed vary with the spacetime coordinates…

A general (convex) polytope $P\subset\mathbb R^d$ and its edge-graph $G_P$ can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the…

Let $P$ and $Q$ be two convex polytopes both contained in the interior of an Euclidean ball $r\textbf{B}^{d}$. We prove that $P=Q$ provided that their sight cones from any point on the sphere $rS^{d-1}$ are congruent. We also prove an…

A $2$-distance $k$-coloring of a graph is a proper vertex $k$-coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance $4$-coloring for planar subcubic graphs with girth at least…

In a Note added in proof to a 1984 paper, Daniel A. Marcus claimed to have a counterexample to his conjecture that a minimal positively k-spanning vector configuration in R^m has size at most 2km. However, the counterexample was never…