English
Related papers

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

200 papers

Let $Q$ be a positive-definite quaternary quadratic form with integer coefficients. We study the problem of giving bounds on the largest positive integer $n$ that is locally represented by $Q$ but not represented. Assuming that $n$ is…

Number Theory · Mathematics 2018-02-13 Jeremy Rouse

Let $Q(x_1, \cdots,x_n)$ be a real indefinite quadratic form of the type $(r,s)$, $n=r+s$, signature $\sigma=r-s$ and determinant $D\neq 0$. Let $\Gamma_{r,n-r}$ denote the infimum of all numbers $\Gamma$ such that for any real numbers…

Number Theory · Mathematics 2024-03-01 Swati Bhardwaj , Leetika Kathuria , Madhu Raka

Let $1<k<7/6$, $\lambda_1,\lambda_2,\lambda_3$ and $\lambda_4$ be non-zero real numbers, not all of the same sign such that $\lambda_1/\lambda_2$ is irrational and let $\omega$ be a real number. We prove that the inequality…

Number Theory · Mathematics 2024-06-26 Alessandro Gambini

Let $k\ge 1$ be an odd integer, $t=\lfloor {{k+2}\over 4}\rfloor$, and $q$ be a prime power. We construct a bipartite, $q$-regular, edge-transitive graph $C\!D(k,q)$ of order $v \le 2q^{k-t+1}$ and girth $g \ge k+5$. If $e$ is the the…

Combinatorics · Mathematics 2016-09-06 Felix Lazebnik , Vasiliy A. Ustimenko , Andrew J. Woldar

We consider the problem of finding $\lambda\in \mathbb{R}$ and a function $u:\mathbb{R}^n\rightarrow\mathbb{R}$ that satisfy the PDE $$ \max\left\{\lambda + F(D^2u) -f(x),H(Du)\right\}=0, \quad x\in \mathbb{R}^n. $$ Here $F$ is elliptic,…

Analysis of PDEs · Mathematics 2015-09-01 Ryan Hynd

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

Let $\lambda_{\phi}(n)$ be the Fourier coefficients of a Hecke holomorphic or Hecke--Maass cusp form on ${\rm SL}_2(\mathbb Z)$, and $f$ be any multiplicative function that satisfies two mild hypotheses. We establish a non-trivial upper…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

We study fixed points with N scalar fields in $4 - \varepsilon$ dimensions to leading order in $\varepsilon$ using a bottom-up approach. We do so by analyzing O(N) invariants of the quartic coupling $\lambda_{ijkl}$ that describes such…

High Energy Physics - Theory · Physics 2021-04-28 Matthijs Hogervorst , Chiara Toldo

Explicit solutions of the cubic Fermat equation are constructed in ring class fields $\Omega_f$, with conductor $f$ prime to $3$, of any imaginary quadratic field $K$ whose discriminant satisfies $d_K \equiv 1$ (mod $3$), in terms of the…

Number Theory · Mathematics 2016-04-15 Patrick Morton

For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots +…

Number Theory · Mathematics 2021-11-16 Paul Buterus , Friedrich Götze , Thomas Hille

Let $f$ be a fixed self-contragradient Hecke-Maass form for $SL(3,\mathbb Z)$, and $u$ an even Hecke-Maass form for $SL(2,\mathbb Z)$ with Laplace eigenvalue $1/4+k^2$, $k>0$. A subconvexity bound $O\big(k^{4/3+\varepsilon}\big)$ in the…

Number Theory · Mathematics 2017-04-12 Mark McKee , Haiwei Sun , Yangbo Ye

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…

Combinatorics · Mathematics 2022-07-27 Ming Xu , Xiaoyan Cheng , Yuansheng Tang

For any constants $d\ge 1$, $\epsilon >0$, $t>1$, and any $n$-point set $P\subset\mathbb{R}^d$, we show that there is a geometric graph $G=(P,E)$ having $O(n\log^2 n\log\log n)$ edges with the following property: For any $F\subseteq P$,…

Computational Geometry · Computer Science 2019-01-08 Prosenjit Bose , Paz Carmi , Vida Dujmovic , Pat Morin

Let $G$ be a graph. A good function is a function $f:V(G)\rightarrow \{-1,1\}$, satisfying $f(N(v))\geq 1$, for each $v\in V(G)$, where $ N(v)=\{u\in V(G)\, |\, uv\in E(G) \} $ and $f(S) = \sum_{u\in S} f(u)$ for every $S \subseteq V(G) $.…

Discrete Mathematics · Computer Science 2014-06-12 S. Akbari , M. Dalirrooyfard , S. Davodpoor , K. Ehsani , R. Sherkati

Let \lambda be a partition of a positive integer n. Let C be a symmetric rigid tensor category over a field k of characteristic 0 or char(k)>n, and let V be an object of C. In our main result (Theorem 4.3) we introduce a finite set of…

Quantum Algebra · Mathematics 2010-03-16 Shlomo Gelaki

We establish for $2 \le k \le n-1$ the strict concavity of the function $f_k(\lambda)=\log(\sigma_k(\lambda))$ on a subset of the positive cone $\Gamma_n=\{\lambda=(\lambda_{1}, \lambda_{2}, \cdots,\lambda_{n})\in \mathbb{R}^n;…

Analysis of PDEs · Mathematics 2020-11-18 Bang Tran Van , Ngoan Ha Tien , Tho Nguyen Huu , Tien Phan Trong

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Combinatorics · Mathematics 2025-11-27 Thang Pham , Semin Yoo

Let $K\subset\mathbb R^d$ be a compact subset equipped with a $\delta$-Ahlfors regular measure $\mu$. For any $\tau>1/d$ and any ``inhomogeneous'' vector $\boldsymbol{\theta}\in\mathbb R^d$, let $W_d(\psi_\tau,\boldsymbol{\theta})$ denote…

Number Theory · Mathematics 2026-02-17 Yubin He , Lingmin Liao

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Information Theory · Computer Science 2017-11-10 Kasper Green Larsen , Jelani Nelson

Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that $d \leq (2n-3)/5$ for every connected $C_4$-free graph of order $n$, diameter $d$, and edge-connectivity at least $3$, which is best possible up to a small…

Combinatorics · Mathematics 2021-12-17 Vanessa Hiebeler , Johannes Pardey , Dieter Rautenbach