Related papers: Resonantly Equivalent Catacondensed Even Ring Syst…
The evaluation of image generators remains a challenge due to the limitations of traditional metrics in providing nuanced insights into specific image regions. This is a critical problem as not all regions of an image may be learned with…
Two Bessel sequences are orthogonal if the composition of the synthesis operator of one sequence with the analysis operator of the other sequence is the 0 operator. We characterize when two Bessel sequences are orthogonal when the Bessel…
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and…
Optical spectroscopies provide a powerful tool for harnessing light-matter interactions for unraveling complex electronic features such as the flat bands and nontrivial topologies of materials. These insights are crucial for the development…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
We present a method for detection of weak continuous signals from sources in binary systems via the incoherent combination of many "short" coherently-analyzed segments. The main focus of the work is on the construction of a metric on the…
We prove the existence and the uniqueness of a conformally equivariant symbol calculus and quantization on any conformally flat pseudo-Riemannian manifold $(M,\rg)$. In other words, we establish a canonical isomorphism between the spaces of…
The study of the structural properties of large random planar graphs has become in recent years a field of intense research in computer science and discrete mathematics. Nowadays, a random planar graph is an important and challenging model…
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…
Subgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge weights are real-valued and may be affected by measurement…
Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…
Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial…
Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…
It has been recently demonstrated that textured closed surfaces which are made out of perfect electric conductors (PECs) can mimic highly localized surface plasmons (LSPs). Here, we propose an effective medium which can accurately model LSP…
Let $D=(\mathcal{P},\mathcal{B})$ be a symmetric $(v,k,\lambda)$-design and let $(X,Y)$ be an equinumerous incidence-free pair, with $X\subseteq \mathcal{P}$ and $Y\subseteq \mathcal{B}$. In this note, we give an elementary proof which…
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…
Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this…
We demonstrate how resonances in a quantum graph consisting of a compact core and semi-infinite leads can be identified from the eigenvalue behavior of the cut-off system.