Related papers: Modular Irregularity Strength of Triangular Book G…
In chemical graph theory, topological indices are widely used as numerical descriptors for establishing quantitative structure-property relationships (QSPR) and quantitative structure-activity relationships (QSAR). These indices…
Barrett et al studied resistance labels of electrical circuits whose underlying graphs when embedded in the Cartesian plane has the form of an $n$-grid, $n$ rows of upright triangles. Proofs in Barrett introduced a row-reduction algorithm…
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…
Model robustness indicates a model's capability to generalize well on unforeseen distributional shifts, including data corruptions and adversarial attacks. Data augmentation is one of the most prevalent and effective ways to enhance…
The purpose of this paper is to generalize Zhu's theorem about characters of modules over a vertex operator algebra graded by integer conformal weights, to the setting of a vertex operator superalgebra graded by rational conformal weights.…
In a previous work, exact formulae and differential equations were found for traces of powers of the zero mode in the W3 algebra. In this paper we investigate their modular properties, in particular we find the exact result for the modular…
In this article we introduce the notion of weak harmonic labeling of a graph, a generalization of the concept of harmonic labeling defined recently by Benjamini et al. that allows extension to finite graphs and graphs with leaves. We…
A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixing Lemmas for irregular graphs make use of the notion of…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…
This paper is a continuation of our previous works (see Mui\'c in Monatsh. Math. 180, no. 3, 607--629, (2016)) and (Mui\'c, Kodrnja in Ramanujan J. 55, no. 2, 393--420, (2021)) where we have studied maps from $X_0(N)$ into $\mathbb P^2$…
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…
Birack modules are modules over an algebra Z[X] associated to a finite birack X. In previous work, birack module structures on Z mod n were used to enhance the birack counting invariant. In this paper, we use birack modules over Laurent…
Many properties of simple finite dimensional gl(m|n)-modules may be better understood by assigning weight diagrams to the highest weights with respect to a given base of simple roots. In this paper we consider bases that are compatible with…
When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…