Related papers: A reduced subduction graph and higher multiplicity…
In this paper, we propose a novel lower dimensional representation of a shape sequence. The proposed dimension reduction is invertible and computationally more efficient in comparison to other related works. Theoretically, the differential…
The QED renormalization is restudied by using a mass-dependent subtraction which is performed at a time-like renormalization point. The subtraction exactly respects necessary physical and mathematical requirements such as the gauge…
We study finite-dimensional representations of the Kauffman skein algebra of a surface S. In particular, we construct invariants of such irreducible representations when the underlying parameter q is a root of unity. The main one of these…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
Graphs are ubiquitous data structures for representing interactions between entities. With an emphasis on the use of graphs to represent chemical molecules, we explore the task of learning to generate graphs that conform to a distribution…
In this paper we obtain some noncommutative multiplier theorems and maximal inequalities on semigroups. As applications, we obtain the corresponding individual ergodic theorems. Our main results extend some classical results of Stein and…
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…
{\sc Vertex $(s, t)$-Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these problems, where in addition to the usual input, we are given a…
We consider the problem of classification of an object given multiple observations that possibly include different transformations. The possible transformations of the object generally span a low-dimensional manifold in the original signal…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
It is argued that several papers where SU(3) Clebsch-Gordan coefficients were calculated in order to describe properties of hadronic systems are, up to a phase convention, particular cases of analytic formulae derived by Hecht in 1965 in…
Existing graph convolutional networks focus on the neighborhood aggregation scheme. When applied to semi-supervised learning, they often suffer from the overfitting problem as the networks are trained with the cross-entropy loss on a small…
Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
The arithmetic mean/geometric mean-inequality (AM/GM-inequality) facilitates classes of non-negativity certificates and of relaxation techniques for polynomials and, more generally, for exponential sums. Here, we present a first systematic…
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
In the present paper we review our project of systematic construction of invariant differential operators on the example of the non-compact algebras su(n,n) for n=2,3,4. We give explicitly the main multiplets of indecomposable elementary…
We study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as \emph{normal} sets. We show that for any $\epsilon>0$, there exists $n_0$ such that if $n>n_0$ and $A$ is a normal subset of…
The symplectic group branching algebra, B, is a graded algebra whose components encode the multiplicities of irreducible representations of Sp(2n-2,C) in each irreducible representation of Sp(2n,C). By describing on B an ASL structure, we…