Related papers: Micronuclear Sequences Associated with Assembly Gr…
Conformation-dependent design of polymer sequences can be considered as a tool to control macromolecular self-assembly. We consider the monomer unit sequences created via the modification of polymers in a homogeneous melt in accordance with…
Seismic tomography is a methodology to image subsurface properties of the Earth. In order to better interpret the resulting images, it is important to assess uncertainty in the results. Mixture density networks (MDNs) provide an efficient…
While dealing in [1] with the supersymmetry of a tridiagonal Hamiltonian H, we have proved that its partner Hamiltonian H(+) also have a tridiagonal matrix representation in the same basis and that the polynomials associated with the…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs…
We seek to automate the design of molecules based on specific chemical properties. In computational terms, this task involves continuous embedding and generation of molecular graphs. Our primary contribution is the direct realization of…
Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…
Moving frames of various kinds are used to derive bi-Hamiltonian operators and associated hierarchies of multi-component soliton equations from group-invariant flows of non-stretching curves in constant curvature manifolds and Lie group…
A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investigate the differences in complexity between Minimum Matching…
Research in semiconductor physics has advanced to the study of two-dimensional (2D) materials where the surface controls electronic transport. A scanning probe microscope (SPM) is an ideal tool to image electronic motion in these devices by…
A beam of holes formed in graphene by a collimating contact is imaged using a liquid-He cooled scanning probe microscope (SPM). The mean free path of holes is greater than the device dimensions. A zigzag shaped pattern on both sides of the…
We consider the problem of minimizing the makespan on batch processing identical machines, subject to compatibility constraints, where two jobs are compatible if they can be processed simultaneously in a same batch. These constraints are…
Self-assemblies, structured via nanoparticles, show promise as materials for advanced applications, like photonic devices, electrochemical energy storage units and catalysis support. Despite observing diverse morphologies, a comprehensive…
The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…
A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and…
In this paper, we continue the study of the Hamiltonian and longest $(s, t)$-paths of supergrid graphs. The Hamiltonian $(s, t)$-path of a graph is a Hamiltonian path between any two given vertices $s$ and $t$ in the graph, and the longest…
Shape assembly composes complex shapes geometries by arranging simple part geometries and has wide applications in autonomous robotic assembly and CAD modeling. Existing works focus on geometry reasoning and neglect the actual physical…
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…