Related papers: A reduced subduction graph and higher multiplicity…

The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph $G$ and demand graph $H$ on a set $T\subseteq V(G)$ of terminals, the task is to find a minimum-weight set $C$ of edges of $G$ such…

Tate's algorithm tells us that for an elliptic curve $E$ over a local field $K$ of residue characteristic $\geq 5$, $E/K$ has potentially good reduction if and only if $\text{ord}(j_E)\geq 0$. It also tells us that when $E/K$ is semistable…

In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e.…

Inspired by Vershik and Okounkov's inductive and Lie-theoretic approach to the representation theory of the symmetric group, we extend their point of view to reducible $S_n$-modules. Using induced representations along Young's lattice, we…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

Let E/F be a quadratic extension of non-archimedean local fields of characteristic 0. In this paper, we investigate two approaches which attempt to describe the smooth irreducible representations of GL(n,E) that are distinguished by its…

A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…

We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…

It can be shown that each permutation group $G \sqsubseteq S_n$ can be embedded, in a well defined sense, in a connected graph with $O(n+|G|)$ vertices. Some groups, however, require much fewer vertices. For instance, $S_n$ itself can be…

Reduction of the left regular representation of quantum algebra $sl_q(3)$ is studied and ~$q$-difference intertwining operators are constructed. The irreducible representations correspond to the spaces of local sections of certain line…

In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the underlying input. These matrices have…

The quadratically divergent scalar mass is subtractively renormalized unlike other divergences which are multiplicatively renormalized. We re-examine some technical aspects of the subtractive renormalization, in particular, the mass…

We give explicit formulas for the asymptotic Betti numbers, over an arbitrary field, of the ordered configuration spaces of a graph. In characteristic zero, we further give explicit formulas for the asymptotic multiplicities in homology of…

In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…

This thesis focuses on theoretical and algorithmic tools for determining the numbers of induced subgraphs in strongly regular graphs, SRGs, and on further applications of such numbers. We consider in more detail a restricted class of these…

We determine the growth of the dimension of the slope subspaces of the cohomology of arithmetic subgroups in reductive algebraic groups as a function of the slope.

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

In a recent work [1, 2] Sjoberg remarked that generalization of the double reduction theory to partial differential equations of higher dimensions is still an open problem. In this note we have attempted to provide this generalization to…

Good approximations have been attained for the sparsest cut problem by rounding solutions to convex relaxations via low-distortion metric embeddings. Recently, Bryant and Tupper showed that this approach extends to the hypergraph setting by…

In this talk we review the classification of the irreducible representations of the algebra of the N-extended one-dimensional supersymmetric quantum mechanics presented in hep-th/0511274. We answer some issues raised in hep-th/0611060,…