Related papers: Optimal strong approximation for quadrics over $\m…

Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…

We propose a new exponential f(R) gravity model with f(R)=(R-\lambda c)e^{\lambda(c/R)^n} and n>3, \lambda\geq 1, c>0 to explain late-time acceleration of the universe. At the high curvature region, the model behaves like the \LambdaCDM…

The parity and time-reversal invariant effective lagrangian for a heavy fermion interacting with an abelian gauge field, i.e., NRQED, is constructed through order $1/M^4$. The implementation of Lorentz invariance in the effective theory…

Let $\Omega=(a,b)\subset\mathbb{R}$, $0\leq m,n\in L^{1}(\Omega)$, $\lambda,\mu>0$ be real parameters, and $\phi:\mathbb{R}\rightarrow\mathbb{R}$ be an odd increasing homeomorphism. In this paper we consider the existence of positive…

For a smooth strictly plurisubharmonic function $u$ on a open set $\Omega\subset\mathbb{C}^{n}$ and $F$ a $C^{1}$ nondecreasing function on $\mathbf{R}^{*}_{+}$, we investigate the complex partial differential equations…

We bound the second eigenvalue of random $d$-regular graphs, for a wide range of degrees $d$, using a novel approach based on Fourier analysis. Let $G_{n, d}$ be a uniform random $d$-regular graph on $n$ vertices, and let $\lambda (G_{n,…

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…

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

In the \textsc{Maximum Degree Contraction} problem, input is a graph $G$ on $n$ vertices, and integers $k, d$, and the objective is to check whether $G$ can be transformed into a graph of maximum degree at most $d$, using at most $k$ edge…

Let $p$ be an odd prime, and suppose $f$ is an $L^2$-normalised newform for $\Gamma_0(p^n)$ with bounded spectral parameters and trivial central character. We prove the optimal $L^4$-norm bound $\lVert f \rVert_4…

It was proved in [8,9] that every Lagrangian submanifold $M$ of a complex space form $\tilde M^{5}(4c)$ of constant holomorphic sectional curvature $4c$ satisfies the following optimal inequality: {align}\tag{A}\delta(2,2)\leq…

Consider systems of equations $q_i(x)=0$, where $q_i: {\Bbb R}^n \longrightarrow {\Bbb R}$, $i=1, \ldots, m$, are quadratic forms. Our goal is to tell efficiently systems with many non-trivial solutions or near-solutions $x \ne 0$ from…

In this paper, we present the best possible parameters $\alpha_i, \beta_i\ (i=1,2,3)$ and $\alpha_4,\beta_4\in(1/2,1)$ such that the double inequalities \begin{align*}…

Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta$ and vertex conductance $\Psi^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap…

In this paper we consider the scale invariant shape functional $${\mathcal{F}}_{p,q}(\Omega)=\frac{\lambda_p^{1/p}(\Omega)}{\lambda_q^{1/q}(\Omega)},$$ where $1\le q<p\le+\infty$ and $\lambda_p(\Omega)$ (respectively $\lambda_q(\Omega)$) is…

In this note we prove the following good-$\lambda$ inequality, for $r>2$, all $\lambda > 0$, $\delta \in \big(0, \frac{1}{2} \big)$ \[ \nu\big\{ V_r(f) > 3 \lambda ; \mathcal{M}(f) \leq \delta \lambda\big\} \leq 4 \nu\{s(f) > \delta…

We define a new notion of cuspidality for representations of $\GL_n$ over a finite quotient $\Oh_k$ of the ring of integers $\Oh$ of a non-Archimedean local field $F$ using geometric and infinitesimal induction functors, which involve…

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

We introduce graphical error-correcting codes, a new notion of error-correcting codes on $[q]^n$, where a code is a set of proper $q$-colorings of some fixed $n$-vertex graph $G$. We then say that a set of $M$ proper $q$-colorings of $G$…