Related papers: Solving the Odd Perfect Number Problem: Some New A…

We analyze the performance of a variant of Newton method with quadratic regularization for solving composite convex minimization problems. At each step of our method, we choose regularization parameter proportional to a certain power of the…

Given $n$ real numbers $0\leq x_1,...,x_n<1$ and a permutation~$\sigma$ of $\{1,...,n\}$, we can always find $\xbar_1,...,\xbar_n\in\{0,1\}$ so that the partial sums $\xbar_1+... +\xbar_k$ and $\xbar_{\sigma 1}+... +\xbar_{\sigma k}$ differ…

Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k n^2$, with $q$ prime, $q \equiv k \equiv 1 \pmod{4}$, and gcd$(q,n)=1$. Dris conjectured that $q^k < n$. We first show that $q<n$ for all odd perfect…

In this paper, we establish the following two congruences: \begin{gather*} \sum_{k=0}^{(p+1)/2}(3k-1)\frac{\left(-\frac{1}{2}\right)_k^2\left(\frac{1}{2}\right)_k4^k}{k!^3}\equiv…

Let $\mathrm{IG}(k, 2n+1)$ be the odd-symplectic Grassmannian. Property $\mathcal{O}$, introduced by Galkin, Golyshev and Iritani for arbitrary complex, Fano manifolds $X$, is a statement about the eigenvalues of the linear operator…

A general form factor formula for the $O(N)\sigma$-model is constructed and applied to several operators. The large N limits of these form factors are computed and compared with the 1/N expansion of the $O(N)\sigma$-model in terms of…

We examine directed spanners through flow-based linear programming relaxations. We design an $\~O(n^{2/3})$-approximation algorithm for the directed $k$-spanner problem that works for all $k\geq 1$, which is the first sublinear…

The sum $\lambda_1 + \lambda_n$ of the maximum and minimum eigenvalues, and the odd girth of a graph both measure bipartiteness. We seek to relate these measures. In particular, for an odd integer $k\geq 3$, let $\gamma_k$ denote the…

In this paper, for any odd $n$ and any integer $m\geq1$ with $n>4m$, we study the fundamental solution of the higher order Schr\"{o}dinger equation \begin{equation*} \mathrm{i}\partial_tu(x,t)=((-\Delta)^m+V(x))u(x,t),\quad t\in…

We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory $\mathrm{APC}_2$ of…

Recent work has established that, for every positive integer $k$, every $n$-node graph has a $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges that is resilient to $f$ edge or vertex faults. For vertex faults, this bound is tight. However,…

Given an irrational number $\alpha\in(0,1)$, the Sudler product is defined by $P_N(\alpha) = \prod_{r=1}^{N}2|\sin\pi r\alpha|$. Answering a question of Grepstad, Kaltenb\"ock and Neum\"uller we prove an asymptotic formula for distorted…

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Let I be the ideal corresponding to a set of general points $p_1,...,p_n \in P^2$. There recently has been progress in showing that a naive lower bound for the Hilbert functions of symbolic powers $I^{(m)}$ is in fact attained when n>9.…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Assuming a suitably uniform version of the prime $k$-tuples conjecture, we show that the number \begin{align*} \sum_{n=1}^\infty \frac{\omega(n)}{2^n} \end{align*} is…

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

We proved that for every sufficiently large $n$, the complete graph $K_{2n}$ with an arbitrary edge signing $\sigma: E(K_{2n}) \to \{-1, +1\}$ admits a high discrepancy $1$-factor decomposition. That is, there exists a universal constant $c…

Conjectures for the Hilbert function of the m-th symbolic power of the ideal of n general points of P2 are verified for infinitely many m for each square n > 9, using an approach developed by the authors in a previous paper. In those cases…

A sequence $S$ is potentially $K_{p_{1},p_{2},...,p_{t}}$ graphical if it has a realization containing a $K_{p_{1},p_{2},...,p_{t}}$ as a subgraph, where $K_{p_{1},p_{2},...,p_{t}}$ is a complete t-partite graph with partition sizes…