Related papers: Computing newforms using supersingular isogeny gra…
We find all $P$-resolutions of quotient surface singularities (especially, tetrahedral, octahedral, and icosahedral singularities) together with their dual graphs, which reproduces Jan Steven's list [Manuscripta Math. 1993] of the numbers…
In this paper we find new maximal cliques of size $\frac{q+1}{2}$ or $\frac{q+3}{2}$, accordingly as $q\equiv 1(4)$ or $q\equiv 3(4)$, in Paley graphs of order $q^2$, where $q$ is an odd prime power. After that we use new cliques to define…
Given a real number $x>0$, we determine $q_s(x):=\inf\mathscr{U}(x)$, where $\mathscr{U}(x)$ is the set of all bases $q\in(1,2]$ for which $x$ has a unique expansion of $0$'s and $1$'s. We give an explicit description of $q_s(x)$ for…
Given a graph $G = (V,E)$, a subgraph $H$ is an \emph{additive $+\beta$ spanner} if $\dist_H(u,v) \le \dist_G(u,v) + \beta$ for all $u, v \in V$. A \emph{pairwise spanner} is a spanner for which the above inequality only must hold for…
Wattenhofer [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the…
A multigraph $G = (V, E)$ is $(k, \ell)$-sparse if every subset $X \subseteq V$ induces at most $\max\{k|X| - \ell, 0\}$ edges. Finding a maximum-size $(k, \ell)$-sparse subgraph is a classical problem in rigidity theory and combinatorial…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…
In this paper, we study deformations of Brieskorn polynomials of two variables obtained by adding linear terms consisting of the conjugates of complex variables and prove that the deformed polynomial maps have only indefinite fold and cusp…
The number of independent sets in regular bipartite expander graphs can be efficiently approximated by expressing it as the partition function of a suitable polymer model and truncating its cluster expansion. While this approach has been…
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is…
We find explicit change-of-basis formulas between Eisenstein series attached to cusps, and newform Eisenstein series attached to pairs of primitive Dirichlet characters. As a consequence, we prove a Bruggeman-Kuznetsov formula for newforms…
By using new techniques with the degenerate Whittaker functions found by Ikeda-Yamana, we construct higher level cusp form on $E_{7,3}$, called Ikeda type lift, from any Hecke cusp form whose corresponding automorphic representation has no…
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
Graph spanners and emulators are sparse structures that approximately preserve distances of the original graph. While there has been an extensive amount of work on additive spanners, so far little attention was given to weighted graphs.…
In a previous paper, the first three authors formulated a precise conjecture about the dimension of the {\it generalized Severi variety} $M^n_{d,g; {\rm S}, {\bf k}}$ of degree-$d$ holomorphic maps $\mathbb{P}^1 \rightarrow \mathbb{P}^n$…
In this paper we consider extensions of the super Virasoro algebra by one and two super primary fields. Using a non-explicitly covariant approach we compute all SW-algebras with one generator of dimension up to 7 in addition to the super…
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum…
In a previous work, the authors resolved a conjecture about the structure of prime-detecting quasi-modular forms by studying sign changes occurring in quasi-modular cusp forms. In this paper, we extend the considerations to prime-detecting…
The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of…
We prove the existence of curves of genus $7$ and $12$ over the field with $11^5$ elements, reaching the Hasse-Weil-Serre upper bound. These curves are quotients of modular curves and we give explicit equations. We compute the number of…