相关论文: On the lower bound in the lattice point remainder …

In this paper we study various Rogers-Shephard type inequalities for the lattice point enumerator $\mathrm{G}_{n}(\cdot)$ on $\mathbb{R}^n$. In particular, for any non-empty convex bounded sets $K,L\subset\mathbb{R}^n$, we show that…

We study finite element approximations of second-order elliptic problems with measure-valued right-hand sides supported on lower-dimensional sets. The exact solution generally lacks $H^1$-regularity due to the source singularity, which…

This paper introduces the $(\alpha, \Gamma)$-descent, an iterative algorithm which operates on measures and performs $\alpha$-divergence minimisation in a Bayesian framework. This gradient-based procedure extends the commonly-used…

We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism…

Suppose $G$ is an amenable locally compact group. If $\{F_\gamma\} = \{F_\gamma\}_{\gamma\in\Gamma}$ is a F\o{}lner net for $G$, associate it with the net $\{\chi_{F_\gamma} / |F_\gamma|\} \subset L_1(G) \subset L_\infty^*(G)$. Thus, every…

In this paper, we proved an exact asymptotically sharp upper bound of the $L^p$ Lebesgue Constant (i.e. the $L^p$ norm of Dirichlet kernel) for $p\ge 2$. As an application, we also verified the implication of a new $\infty $-R\'enyi entropy…

We study representations of a Leavitt path algebra $L$ of a finitely separated digraph $\Gamma$ over a field. We show that the category of $L$-modules is equivalent to a full subcategory of quiver representations. When $\Gamma$ is a…

We show that the isotropic discrepancy of a lattice point set can be bounded from below and from above in terms of the spectral test of the corresponding integration lattice. From this we deduce that the isotropic discrepancy of any…

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

Given a positive integer $k$ and graph $G$, the $\mathbb{Z}_k$-Ramsey number $R(G,\mathbb{Z}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\rightarrow \mathbb{Z}_k$ contains a copy $G'$ of $G$ such that $\sum_{e\in…

Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\rm dim}_l(G)$, local adjacency metric dimension $ {\rm dim}_{A,l}(G)$, and clique number $ \omega(G)$, where $G\not\cong K_{n(G)}$ and $\omega(G)\geq3$. It…

It is shown that solutions to the anisotropic least gradient problem for boundary data $f \in L^p(\partial\Omega)$ lie in $L^{\frac{Np}{N-1}}(\Omega)$; the exponent is shown to be optimal. Moreover, the solutions are shown to be locally…

Let $\Omega\subset\mathbb{R}^n$ be a domain, $\Gamma$ be a hyperplane intersecting it. Let $\varepsilon>0$, and $\Omega_\varepsilon=\Omega\setminus\overline{\Sigma_\varepsilon}$, where $\Sigma_\varepsilon$ ("sieve") is an…

We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to $\approx \exp(1.96 \times 10^{19})$, which is significantly below the conjectured value of $\approx \exp(5.15 \times…

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

We use De Giorgi-Nash-Moser iteration scheme to establish that weak solutions to a coupled system of elliptic equations with critical growth on the boundary are in $L^\infty(\Omega)$. Moreover, we provide an explicit $L^\infty(\Omega)$-…

Based on a fairly precise approximation to the lattice discrepancy of a Lame disc, an asymptotic formula is established for the number of lattice points in a related three-dimensional body, linearly dilated by a large real parameter x.…

For a graph $G,$ let $\alpha(G)$ denote its second smallest Laplacian eigenvalue. The Laplacian Spread Conjecture states that $\alpha(G)+\alpha(\overline{G}) \geq 1,$ where $\overline{G}$ is the complement of $G.$ In this paper, we have…

We study the logarithmic capacity of $G_\delta$ subsets of the interval $[0,1].$ Let $S$ be of the form \begin{align*} S=\bigcap_m \bigcup_{k\ge m} I_k, \end{align*} where each $I_k$ is an interval in $[0,1]$ with length $l_k$ that decrease…

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line…