Related papers: Micronuclear Sequences Associated with Assembly Gr…

We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right…

We present a Gaussian ensemble of random cyclic matrices on the real field and study their spectral fluctuations. These cyclic matrices are shown to be pseudo-symmetric with respect to generalized parity. We calculate the joint probability…

Ultrathin sheets of MoS2 are a newly discovered 2D semiconductor that holds great promise for nanoelectronics. Understanding the pattern of current flow will be crucial for developing devices. In this talk, we present images of current flow…

Large protein complexes are assembled from protein subunits to form a specific structure. In our theoretic work, we propose that assembly into the correct structure could be reliably achieved through an assembly line with a specific…

Asymmetric exclusion processes for particles moving on parallel channels with inhomogeneous coupling are investigated theoretically. Particles interact with hard-core exclusion and move in the same direction on both lattices, while…

Vector solitons (VSs), being observed across various fields from optics to Bose-Einstein condensates, are localized structures composed of orthogonal modes bound by nonlinear couplings. Nevertheless, the influence of intermodal linear…

We study which signs can occur among Hamiltonian circles in simple plane signed graphs. Using a face-based viewpoint, we relate the sign of a Hamiltonian circle to the product of the signs of the faces inside it, and we introduce…

A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at one of it vertex $v$ consists to complement the edges between the neighborhood and the non-neighborhood…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

We study the entanglement Hamiltonian of two disjoint blocks in the harmonic chain on the line and in its ground state. In the regime of large mass, the non vanishing terms are only the on-site and the nearest-neighbour ones. Analytic…

Let $G$ be a simple graph of order $n$. The double vertex graph $F_2(G)$ of $G$ is the graph whose vertices are the $2$-subsets of $V(G)$, where two vertices are adjacent in $F_2(G)$ if their symmetric difference is a pair of adjacent…

Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…

We propose cotunneling as the microscopic mechanism that makes possible inelastic electron spectroscopy of magnetic atoms in surfaces for a wide range of systems, including single magnetic adatoms, molecules and molecular stacks. We…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…

In the graph node embedding problem, embedding spaces can vary significantly for different data types, leading to the need for different GNN model types. In this paper, we model the embedding update of a node feature as a Hamiltonian orbit…

A symmetry analysis is presented for the three-dimensional nonrelativistic motion of charged particles in arbitrary stationary electromagnetic fields. The general form of the Lie point symmetries is found along with the fields that respect…

Graph neural networks (GNNs) and message passing neural networks (MPNNs) have been proven to be expressive for subgraph structures in many applications. Some applications in heterogeneous graphs require explicit edge modeling, such as…

We present a comprehensive study of the band alignments of two-dimensional (2D) semiconducting materials and highlight the possibilities of forming momentum-matched type I, II and III heterojunctions; an enticing possibility being atomic…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…