Related papers: Mixed orthogonal arrays, $(u,m,{\bf e},s)$-nets, a…
Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due to the exhaustive matching between tree nodes. To address…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
Given an orthogonal polynomial sequence on the real line, another sequence of polynomials can be found by composing these polynomials with a general M\"obius transformation. In this work, we study the properties of such M\"obius-transformed…
In this paper we introduce I^K-convergence which is a common generalization of the I^K-convergence of sequences, double sequences and nets. We show that many results that were shown before for these special cases are true for the…
An extension is given of a recent result of Glazyrin, showing that an orthonormal basis $\{e_{i}\}_{i=1}^{d}$ joined with the vectors $\{e_{j}\}_{j=1}^{m}$, where $1\leq m < d$ minimizes the $p$-frame potential for…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane P2. They are used in the studies of resonance and characteristic varieties of complex hyperplane arrangement complements and…
Aydinian et al. [J. Combinatorial Theory A 118(2)(2011), 702-725] substituted the usual BLYM inequality for L-Sperner families with a set of M inequalities for $(m_1,m_2,...,m_M;L_1,L_2,...,L_M)$ type M-part Sperner families and showed that…
We propose a testable universality hypothesis, asserting that seemingly disparate neural network solutions observed in the simple task of modular addition are unified under a common abstract algorithm. While prior work interpreted…
We present a systematic study of join-extensions and join-completions of ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from…
We establish, for every family of orthogonal polynomials in the $ q $-Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths on the lecture hall graph. This generalizes the previous…
The use of random samples to approximate properties of geometric configurations has been an influential idea for both combinatorial and algorithmic purposes. This chapter considers two related notions---$\epsilon$-approximations and…
The first paper in this series introduced a \emph{short-to-long mixing} condition that captures mean-field GOE/GUE edge universality in the supercritical sparsity regime, for symmetric/Hermitian random matrices with independent entries and…
Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…
Induced by three gluons symmetry, Mandelstam variables $s$, $t$, $u$ symmetric expressions are widely involved in collider physics, especially in heavy quarkonium physics. In this work we study general form of $s$, $t$, $u$ symmetric…
We prove that a cubic graph with $m$ edges has an induced matching with at least $m/9$ edges. Our result generalizes a result for planar graphs due to Kang, Mnich, and M\"{u}ller (Induced matchings in subcubic planar graphs, SIAM J.…
Augmented orthogonal arrays (AOAs) were introduced by Stinson, who showed the equivalence between ideal ramp schemes and augmented orthogonal arrays (Discrete Math. 341 (2018), 299-307). In this paper, we show that there is an…
Generalising previous results on classical braid groups by Artin and Lin, we determine the values of m, n $\in$ N for which there exists a surjection between the n-and m-string braid groups of an orientable surface without boundary. This…
This paper introduces a new class of efficient inter connection networks called as M-graphs for large multi-processor systems.The concept of M-matrix and M-graph is an extension of Mn-matrices and Mn-graphs.We analyze these M-graphs…
Network datasets typically exhibit certain types of statistical dependencies, such as within-dyad correlation, row and column heterogeneity, and third-order dependence patterns such as transitivity and clustering. The first two of these can…
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new…