Related papers: A Note on John Simplex with Positive Dilation
We establish the well-posedness of linear elliptic equations with critical-order drifts in $L^d$ and positive zero-order coefficients in $L^1$ or $L^{\frac{2d}{d+2}}$, where classical methods are often too restrictive. Our approach relies…
In this paper, we give a description of the John contact points of a regular simplex. We prove that the John ellipsoid of any simplex is ball if and only if this simplex is regular and that the John ellipsoid of a regular simplex is its…
We consider the weak version of the Deligne-Simpson problem: give necessary and sufficient conditions upon the conjugacy classes $c_j\subset gl(n,{\bf C})$ (resp. $C_j\subset GL(n,{\bf C})$) so that there exist $(p+1)$-tuples of matrices…
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,\…
This paper investigates the well-posedness of linear elliptic equations, focusing on the divergence-free transformation introduced in the author's recent work [J. Math. Anal. Appl. 548 (2025), 129425]. By comparing this approach with…
Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as…
In this paper we provide an explicit formula for the optimal lower bound of Donaldson's J-functional, in the sense of finding explicitly the optimal constant in the definition of coercivity, which always exists and takes negative values in…
If $\mathcal{B}\subset \mathbb{R}^d$ ($d\geqslant 2$) is a compact convex domain with a smooth boundary of finite type, we prove that for almost every rotation $\theta\in SO(d)$ the remainder of the lattice point problem, $P_{\theta…
We study a variation of the Shepard approximation scheme by introducing a dilation factor into the base function, which synchronizes with the Hausdorff distance between the data set and the domain. The novelty enables us to establish an…
Dimensional reduction of generalized gravity theories or string theories generically yields dilaton fields in the lower-dimensional effective theory. Thus at the level of D=4 theories, and cosmology many models contain more than just one…
We study the problem of maximizing the minimal value over the sphere $S^{d-1}\subset \mathbb R^d$ of the potential generated by a configuration of $d+1$ points on $S^{d-1}$ (the maximal discrete polarization problem). The points interact…
This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…
We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…
Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ its $k$-fold iterate. In this note, we improve the upper bound for the number of positive $n\leqslant x$ such that $\phi_{k+1}(n)\geqslant cn$. Comparing with the upper bound which…
We prove that if $\phi: {\Bbb R}^d \times {\Bbb R}^d \to {\Bbb R}$, $d \ge 2$, is a homogeneous function, smooth away from the origin and having non-zero Monge-Ampere determinant away from the origin, then $$ R^{-d} # \{(n,m) \in {\Bbb Z}^d…
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…
Cilleruelo conjectured that if $f\in\mathbb{Z}[x]$ of degree $d\ge 2$ is irreducible over the rationals, then $\log\operatorname{lcm}(f(1),\ldots,f(N))\sim(d-1)N\log N$ as $N\to\infty$. He proved it for the case $d = 2$. Very recently,…
We investigate the decomposition of a set $X$, which positively spans the Euclidean space $\mathbb{R}^{d}$ into a set of minimal positive bases, we call simplices, and into maximal sets positively spanning pointed cones, i.e. cones with…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
A great challenge in the analysis of the discrepancy function D_N is to obtain universal lower bounds on the L-infty norm of D_N in dimensions d \geq 3. It follows from the average case bound of Klaus Roth that the L-infty norm of D_N is at…