Related papers: P_k and C_k structure and substructure connectivit…
Fels-Kaup (Acta Mathematica 2008) classified homogeneous $\mathfrak{C}_{2,1}$ hypersurfaces $M^5 \subset \mathbb{C}^3$ and discovered that they are all biholomorphic to tubes $S^2 \times i \mathbb{R}^3$ over some affinely homogeneous…
Given a graph $H$, let $G^j_k(H)$ be the graph whose vertices are the proper $k$-colorings of $H$, with edges joining two colorings if $H$ contains a connected subgraph on at most $j$ vertices that includes all vertices where the colorings…
We introduce a blackbox framework that simplifies all known parallel algorithms with near-linear work for single-source reachability and shortest paths in directed graphs. Specifically, existing reachability algorithms rely on constructing…
Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the…
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width,…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
Modelling across engineering, systems science, and formal methods remains limited by binary relations, implicit semantics, and diagram-centred notations that obscure multilevel structure and hinder mechanisation. Hypernetwork Theory (HT)…
The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper proves that $VQ_n$ is vertex-transitive. This property shows that when $VQ_n$ is…
Heterogeneous base stations (e.g. picocells, microcells, femtocells and distributed antennas) will become increasingly essential for cellular network capacity and coverage. Up until now, little basic research has been done on the…
The edge-fault-tolerance of networks is of great significance to the design and maintenance of networks. For any pair of vertices $u$ and $v$ of the connected graph $G$, if they are connected by $\min \{ \deg_G(u),\deg_G(v)\}$ edge-disjoint…
Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, joint interactions of proteins, to name a few. In this work, we propose tools for answering the…
For a domain $D\subset{\Bbb C}$ the Kobayashi--Royden $\kappa$ and Hahn $h$ pseudometrics are equal iff $D$ is simply connected. Overholt showed that for $D\subset{\Bbb C}^n$, $n\geq3$, we have $h_D\equiv\kappa_D$. Let $D_1,D_2\subset{\Bbb…
Multitenancy increases throughput and reduces costs in cloud-based quantum computing, but concurrent job execution introduces security risks through inter-circuit crosstalk. We characterize the structural predictability of these…
In this paper, we study the analytic connectivity of a $k$-uniform hypergraph $H$, denoted by $\alpha(H)$. In addition to computing the analytic connectivity of a complete $k$-graph, we present several bounds on analytic connectivity that…
The interplay between superconductivity and ferromagnetism in the superconductor/ferromagnet (SC/FM) heterostructures generates many interesting physical phenomena, including spin-triplet superconductivity, superconducting order parameter…
The hypercube Q_n is the graph whose vertex set is {0,1}^n and where two vertices are adjacent if they differ in exactly one coordinate. For any subgraph H of the cube, let ex(Q_n, H) be the maximum number of edges in a subgraph of Q_n…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width,…
High Performance Computing (HPC), Artificial Intelligence (AI)/Machine Learning (ML), and Quantum Computing (QC) and communications offer immense opportunities for innovation and impact on society. Researchers in these areas depend on…
In this work we present a robust interface coupling algorithm called Compact Interface quasi-Newton (CIQN). It is designed for computationally intensive applications using an MPI multi-code partitioned scheme. The algorithm allows to reuse…