Related papers: A reduced subduction graph and higher multiplicity…
This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphisms from a complete bipartite graph into a general bipartite…
Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
Supersymmetric partition function of $\mathcal N=1$ superconformal theories on $S^1_{\beta} \times S^3$ is related to the superconformal index receiving contributions from short representations. The leading coefficients in the small $\beta$…
We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the…
Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…
Let $M_\phi$ be a surface bundle over a circle with monodromy $\phi:S \rightarrow S$. We study deformations of certain reducible representations of $\pi_1(M_\phi)$ into $\text{SL}(n,\mathbb{C})$, obtained by composing a reducible…
In the present paper we continue the project of systematic construction of invariant differential operators on the example of the non-compact algebras $su(n,n)$. Earlier were given the main multiplets of indecomposable elementary…
The Birkhoff graph $\mathcal{B}_n$ is the Cayley graph of the symmetric group $S_n$, where two permutations are adjacent if they differ by a single cycle. Our main result is a tighter upper bound on the independence number…
The present contribution is the written counterpart of a talk given in Yerevan at the SQS'2019 International Workshop "Supersymmetries and Quantum Symmetries" (SQS'2019, 26 August - August 31, 2019). After a short presentation of various…
Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary…
A wider selection of step sizes is explored for the distributed subgradient algorithm for multi-agent optimization problems, for both time-invariant and time-varying communication topologies. The square summable requirement of the step…
Representation learning on graphs has been gaining attention due to its wide applicability in predicting missing links, and classifying and recommending nodes. Most embedding methods aim to preserve certain properties of the original graph…
Learning distributed representations for nodes in graphs is a crucial primitive in network analysis with a wide spectrum of applications. Linear graph embedding methods learn such representations by optimizing the likelihood of both…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
The reduction of couplings idea consists in the search for renormalization group invariant relations between seemingly independent parameters of a theory that hold to all orders of perturbation theory. This concept can be applied to $N=1$…
The renormalization group is used to resum leading logarithmic contributions of the form alpha_s^{n+1} beta_0^n log^n (Delta/mu) to the gap equation appropriate for high density QCD. The scale dependence of the strong coupling constant…
We consider the problem of optimal recovery of true ranking of $n$ items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of $\Omega(n^2)$ for the…