相关论文: Resonantly Equivalent Catacondensed Even Ring Syst…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, ordinary star-like self-contained graphs are introduced and it is shown that every ordinary star-like self-contained…
This research resolves a long-standing problem on the electromagnetic response of self-complementary metallic screens with checkerboardlike geometry. Although Babinet's principle implies that they show a frequency-independent response, this…
Coherence is an important aspect of text quality, and various approaches have been applied to coherence modeling. However, existing methods solely focus on a single document's coherence patterns, ignoring the underlying correlation between…
This work employs a new approach to analyze coupled-resonator circuits to design and manufacture a fully metallic dual polarization frequency selective surface (FSS). The proposed filtering structure is composed of a series of unit cells…
A maximal $\varepsilon$-near perfect matching is a maximal matching which covers at least $(1-\varepsilon)|V(G)|$ vertices. In this paper, we study the number of maximal near perfect matchings in generalized quasirandom and dense graphs. We…
Graph encoder embedding, a recent technique for graph data, offers speed and scalability in producing vertex-level representations from binary graphs. In this paper, we extend the applicability of this method to a general graph model, which…
In this note on coarse geometry we revisit coarse homotopy. We prove that coarse homotopy indeed is an equivalence relation, and this in the most general context of abstract coarse structures. We introduce (in a geometric way) coarse…
One-dimensional optical waveguiding is revisited using the electromagnetic deduction of Fresnel formulas relating the incident, reflected, and transmitted waves on the abrupt interface between two different optical media. Throughout the…
We consider {\em L-graphs}, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing connections to Schnyder realizers and canonical orders of…
We discuss diagrammatic modifications to the coupled cluster doubles (CCD) equations, wherein different groups of terms out of rings, ladders, crossed-rings and mosaics can be removed to form approximations to the coupled cluster method, of…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We prove the existence of Rado sets in the Banach space of continuous functions on [0,1]. A countable dense set S is Rado if with probability 1, the infinite geometric random graph on S, formed by probabilistically making adjacent elements…
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…
We present the Collection of Elemental Routines for Echelle Spectra (CERES). These routines were developed for the construction of automated pipelines for the reduction, extraction and analysis of spectra acquired with different…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for…
S. Baker (2019), B. B\'ar\'any and A. K\"{a}enm\"{a}ki (2019) independently showed that there exist iterated function systems without exact overlaps and there are super-exponentially close cylinders at all small levels. We adapt the method…
Circular perfect graphs are those undirected graphs such that the circular clique number is equal to the circular chromatic number for each induced subgraph. They form a strict superclass of the perfect graphs, whose index coding broadcast…
We prove that the joint spectral radius and generalized spectral radius are equal for any bounded, equicontinuous family of order-preserving, homogeneous maps on a polyhedral cone. We also consider conditions which guarantee that the…
An equiangular tight frame (ETF) is a set of unit vectors whose coherence achieves the Welch bound, and so is as incoherent as possible. Though they arise in many applications, only a few methods for constructing them are known. Motivated…