Related papers: Large Shadows from Sparse Inequalities
Rayleigh scattering has shown powerful abilities to study electron resonances of nanomaterials regardless of the specific shapes. In analogy to Rayleigh scattering, here we demonstrate that edge optical scattering from two-dimensional (2D)…
The moduli space of cubic surfaces in complex projective space is known to be isomorphic to the quotient of the complex 4-ball by a certain arithmetic group. We apply Borcherds' techniques to construct automorphic forms for this group and…
State of the art domain decomposition algorithms for large-scale boundary value problems (with $M\gg 1$ degrees of freedom) suffer from bounded strong scalability because they involve the synchronisation and communication of workers…
We study shadow aspects of superentropic black holes in four dimensions. Using Hamilton-Jacobi formalism, we first get the null geodesic equations. In the celestial coordinate framework relying on fixed positions of observers, we…
We show that an idempotent variety has a $d$-dimensional cube term if and only if its free algebra on two generators has no $d$-ary compatible cross. We employ Hall's Marriage Theorem to show that a variety of finite signature whose…
Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of…
We extend finding geometrically-significant preserved quantities by solving specific PDEs to the affine transformations and subgroups. This can be viewed not only as a purely geometrical problem but also as a subcase of finding physical…
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
We present a general approach to prove the existence, both locally and globally in amplitude, of fully localised multi-dimensional patterns in partial differential equations containing a compact spatial heterogeneity. While one-dimensional…
We present a case study elaborating on the multiplicity and self-similarity of homoclinic and heteroclinic bifurcation structures in the 2D and 3D parameter spaces of a nonlinear laser model with a Lorenz-like chaotic attractor. In a…
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…
In 1967, Gr\"unmbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. This conjecture along with the…
It is well-known that the $d$-dimensional hypercube contains a Hamilton cycle for $d\ge 2$. In this paper we address the analogous problem in the $3$-uniform cube hypergraph, a $3$-uniform analogue of the hypercube: for simple parity…
An edge-coloring of a multigraph G with colors 1,2,...,t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that…
Carbon exhibits both a layered ground state structure that produces two-dimensional (2D) nanosheets and a non-layered diamond structure created under high pressure conditions. Motivated by this metastability relationship, we revisit the…
The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…
A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An interval total $t$-coloring of a graph $G$ is a total coloring of…
Finite geometry is used to underpin finite, $d^2$, dimensional Hilbert space accommodating two particles, d dimensional each. d=prime $\ne2$. Central role is allotted to states with mutual unbiased bases (MUB) labelling underpinned with…
A subgraph of the $n$-dimensional hypercube is called 'layered' if it is a subgraph of a layer of some hypercube. In this paper we show that there exist subgraphs of the cube of arbitrarily large girth that are not layered. This answers a…