相关论文: Smarandache Multi-Space Theory(II)--Multi-spaces o…
Metric approximate categories, or metagories, for short, are metrically enriched graphs. Their structure assigns to every directed triangle in the graph a value which may be interpreted as the area of the triangle; alternatively, as the…
A synchrony subspace of R^n is defined by setting certain components of the vectors equal according to an equivalence relation. Synchrony subspaces invariant under a given set of square matrices form a lattice. Applications of these…
We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional analytic framework provides a universal language for various…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
The concept of "multiplicity of solutions" was developed in arXiv:1509.02603v2 which is based on the theory of energy operators in the Schwartz space S^-(R) and some subspaces called energy spaces first defined in arXiv:1208.3385 and…
Branching of symplectic groups is not multiplicity-free. We describe a new approach to resolving these multiplicities that is based on studying the associated branching algebra $B$. The algebra $B$ is a graded algebra whose components…
We discuss supersymmetry in twelve dimensions and present a covariant supersymmetric action for a brane with worldsheet signature (2,2), called a super (2+2)-brane, propagating in the osp(64,12) superspace. This superspace is explicitly…
Type IIA brane configurations are used to construct N=2 supersymmetric gauge theories in two dimensions. Using localization of chiral multiplets in ten-dimensional spacetime, supersymmetric non-linear sigma models with target space such as…
The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
We consider multiverses as time-amalgamated multiply warped products of Lorentzian (Einstein) manifolds. We define the Local Multiverse as timely-connected component of our physical (3+1)-spacetime. It is a collection of ``parallel…
This paper is devoted to the study of strongly quasinonexpansive mappings in an abstract space and a Banach space.
The main result says that every surjective isometry between two ideal Banach function spaces satisfying certain conditions can be presented as a composition of a measurable transformation of a variable and multiplication by a function.
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
This paper reviews work, largely due to W. Simon and the author, on multipole theory of static spacetimes. The main purpose is to make this work, which lies at the interface of potential theory, conformal geometry and general relativity,…
We use the Maple system to check the investigations of S. S. Gupta regarding the Smarandache consecutive and the reversed Smarandache sequences of triangular numbers [Smarandache Notions Journal, Vol. 14, 2004, pp. 366-368]. Furthermore, we…
A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…
Relationships between entities in datasets are often of multiple nature, like geographical distance, social relationships, or common interests among people in a social network, for example. This information can naturally be modeled by a set…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…