相关论文: Micronuclear Sequences Associated with Assembly Gr…
Non-linearities play an important role in micro- and nano- electromechanical system (MEMS and NEMS) design. In common electrostatic and magnetic actuators, the forces and voltages can depend in a non-linear way on position, charge, current…
Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
Plasmonic gratings constitute a paradigmatic instance of the wide range of applications enabled by plasmonics. While subwavelength metal gratings find applications in optical biosensing and photovoltaics, atomically thin gratings achieved…
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…
Graph spectral techniques for measuring graph similarity, or for learning the cluster number, require kernel smoothing. The choice of kernel function and bandwidth are typically chosen in an ad-hoc manner and heavily affect the resulting…
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…
Partial dynamical symmetries (PDS) are shown to be relevant to the interpretation of the $K=0_2$ band and to the occurrence of F-spin multiplets of ground and scissors bands in deformed nuclei. Hamiltonians with bosonic and fermionic PDS…
Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles,…
Supergrid graphs contain grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for general supergrid graphs were known to be NP-complete. A graph is called Hamiltonian if it contains a…
In this paper we present a novel framework for sequence to shape maps. These combinatorial maps realize exponentially many shapes, and have preimages which contain extended connected subgraphs of diameter n (neutral networks). We prove that…
Plasmons in two-dimensional electron gas (2DEG) strips with grounded electrodes (a gate or side contacts) are investigated. We consider two systems: (a) the 2DEG strip with a highly conducting gate and (b) the 2DEG strip with semi-infinite…
Understanding interactions between microparticles and lipid membranes is of increasing importance, especially for unraveling the influence of microplastics on our health and environment. Here, we study how a short-ranged adhesive force…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…
We investigate through analytic calculations the surface plasmon dispersion relation for monolayer graphene sheets and a separated parallel pair of graphene monolayers. An approximate form for the dispersion relation for the monolayer case…
A Hamiltonian graph is 2-factor Hamiltonian (2FH) if each of its 2-factors is a Hamiltonian cycle. A similar, but weaker, property is the Perfect-Matching-Hamiltonian property (PMH-property): a graph admitting a perfect matching is said to…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…