Let and be the algebra of all bounded linear operators on a complex Hilbert space and the Jordan algebra of all self-adjoint operators in , respectively. In this paper, we give characterizations of rank one operators by the pseudospectrum on -Lie product of bounded linear operators and discuss some properties about the pseudospectrum. As applications, we obtain the structures of all surjective maps preserving the pseudospectrum of -Lie product on and , respectively.
{"title":"Pseudospectrum of -Lie product on bounded linear operators","authors":"Jiahe Guo, Xiaofei Qi, Shaoxing Sun, Yujie Tuo","doi":"10.1112/mtk.70079","DOIUrl":"10.1112/mtk.70079","url":null,"abstract":"<p>Let <span></span><math></math> and <span></span><math></math> be the algebra of all bounded linear operators on a complex Hilbert space <span></span><math></math> and the Jordan algebra of all self-adjoint operators in <span></span><math></math>, respectively. In this paper, we give characterizations of rank one operators by the pseudospectrum on <span></span><math></math>-Lie product of bounded linear operators and discuss some properties about the pseudospectrum. As applications, we obtain the structures of all surjective maps preserving the pseudospectrum of <span></span><math></math>-Lie product on <span></span><math></math> and <span></span><math></math>, respectively.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 2","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146217334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The combinatorial discrepancy of arithmetic progressions inside is the smallest integer for which can be colored with two colors so that any arithmetic progression in contains at most more elements from one color class than the other. Bounding the discrepancy of such set systems is a classical problem in the discrepancy theory. More recently, this problem was generalized to arithmetic progressions in grids like (Valkó) and (Fox, Xu, and Zhou). In the latter setting, Fox, Xu, and Zhou gave upper and lower bounds on the discrepancy that match within a factor, where is the ground set. In this work, we use the connection between factorization norms and discrepancy to improve their upper bound to be within a factor from the lower bound. We also generalize Fox, Xu, and Zhou's lower bound, and our upper bounds to arithmetic progressions in arbitrary convex bodies.
其中的等差数列的组合差值是可以用两种颜色着色的最小整数,以便其中的任何等差数列最多包含来自一种颜色类的元素多于另一种颜色类的元素。这类集合系统的差值边界是差值理论中的一个经典问题。最近,这个问题被推广到网格中的算术级数,如(Valkó)和(Fox, Xu, and Zhou)。在后一种情况下,Fox, Xu和Zhou给出了在一个因子内匹配的差异的上界和下界,其中为ground set。在这项工作中,我们利用分解规范和差异之间的联系来改进它们的上界,使其与下界在一个因子内。我们还将Fox, Xu和Zhou的下界和上界推广到任意凸体中的等差数列。
{"title":"Discrepancy of arithmetic progressions in boxes and convex bodies","authors":"Lily Li, Aleksandar Nikolov","doi":"10.1112/mtk.70076","DOIUrl":"10.1112/mtk.70076","url":null,"abstract":"<p>The combinatorial discrepancy of arithmetic progressions inside <span></span><math></math> is the smallest integer <span></span><math></math> for which <span></span><math></math> can be colored with two colors so that any arithmetic progression in <span></span><math></math> contains at most <span></span><math></math> more elements from one color class than the other. Bounding the discrepancy of such set systems is a classical problem in the discrepancy theory. More recently, this problem was generalized to arithmetic progressions in grids like <span></span><math></math> (Valkó) and <span></span><math></math> (Fox, Xu, and Zhou). In the latter setting, Fox, Xu, and Zhou gave upper and lower bounds on the discrepancy that match within a <span></span><math></math> factor, where <span></span><math></math> is the ground set. In this work, we use the connection between factorization norms and discrepancy to improve their upper bound to be within a <span></span><math></math> factor from the lower bound. We also generalize Fox, Xu, and Zhou's lower bound, and our upper bounds to arithmetic progressions in arbitrary convex bodies.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 2","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/mtk.70076","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146217090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A classical theorem of Macbeath states that for any integers , , -dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with vertices. In this paper, we investigate normed variants of this problem: we intend to find the extremal values of the Busemann volume, Holmes–Thompson volume, Gromov's mass, and Gromov's of a largest volume convex polytope with vertices, inscribed in the unit ball of a -dimensional normed space.
{"title":"Variants of a theorem of Macbeath in finite-dimensional normed spaces","authors":"Zsolt Lángi, Shanshan Wang","doi":"10.1112/mtk.70078","DOIUrl":"10.1112/mtk.70078","url":null,"abstract":"<p>A classical theorem of Macbeath states that for any integers <span></span><math></math>, <span></span><math></math>, <span></span><math></math>-dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with <span></span><math></math> vertices. In this paper, we investigate normed variants of this problem: we intend to find the extremal values of the Busemann volume, Holmes–Thompson volume, Gromov's mass, and Gromov's <span></span><math></math> of a largest volume convex polytope with <span></span><math></math> vertices, inscribed in the unit ball of a <span></span><math></math>-dimensional normed space.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 2","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/mtk.70078","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For every irrational real , let denote the largest partial quotient in its continued fraction expansion (or , if unbounded). The 2-adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational such that is uniformly bounded by a constant for all . In 2016, Badziahin proved (considering a different formulation of 2LC) that if a counterexample exists, then the bound is at least 8. We improve this bound to 15. Then we focus on a “B-variant” of 2LC, where we replace by . In this setting, we prove that if for all , then . For the proof we use Hurwitz's algorithm for multiplication of continued fractions by 2. Along the way, we find families of quadratic irrationals with the property that for arbitrarily large there exist all equivalent to .
{"title":"Some bounds related to the 2-adic Littlewood conjecture","authors":"Dinis Vitorino, Ingrid Vukusic","doi":"10.1112/mtk.70073","DOIUrl":"10.1112/mtk.70073","url":null,"abstract":"<p>For every irrational real <span></span><math></math>, let <span></span><math></math> denote the largest partial quotient in its continued fraction expansion (or <span></span><math></math>, if unbounded). The 2-adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational <span></span><math></math> such that <span></span><math></math> is uniformly bounded by a constant <span></span><math></math> for all <span></span><math></math>. In 2016, Badziahin proved (considering a different formulation of 2LC) that if a counterexample exists, then the bound <span></span><math></math> is at least 8. We improve this bound to 15. Then we focus on a “B-variant” of 2LC, where we replace <span></span><math></math> by <span></span><math></math>. In this setting, we prove that if <span></span><math></math> for all <span></span><math></math>, then <span></span><math></math>. For the proof we use Hurwitz's algorithm for multiplication of continued fractions by 2. Along the way, we find families of quadratic irrationals <span></span><math></math> with the property that for arbitrarily large <span></span><math></math> there exist <span></span><math></math> all equivalent to <span></span><math></math>.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 2","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/mtk.70073","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146136893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 2021, Ordentlich, Regev, and Weiss made a breakthrough that the lattice covering density of any -dimensional convex body is upper bounded by , improving on the best previous bound established by Rogers in 1959. However, for the Euclidean ball, Rogers obtained the better upper bound , and this result was extended to certain symmetric convex bodies by Gritzmann. The constant above is independent on . In this paper, we show that such a bound can be achieved for more general classes of convex bodies without symmetry, including anti-blocking bodies, locally anti-blocking bodies and -dimensional polytopes with vertices.
2021年,Ordentlich, Regev, and Weiss突破了任意维凸体的晶格覆盖密度的上界,改进了Rogers在1959年建立的最佳上界。而对于欧几里得球,Rogers得到了更好的上界,Gritzmann将这一结果推广到某些对称凸体。上面的常数是独立于。在本文中,我们证明了对于更一般的非对称凸体,包括抗阻塞体,局部抗阻塞体和带顶点的多维多面体,可以实现这样的界。
{"title":"On lattice coverings by locally anti-blocking bodies and polytopes with few vertices","authors":"Matthias Schymura, Jun Wang, Fei Xue","doi":"10.1112/mtk.70072","DOIUrl":"https://doi.org/10.1112/mtk.70072","url":null,"abstract":"<p>In 2021, Ordentlich, Regev, and Weiss made a breakthrough that the lattice covering density of any <span></span><math></math>-dimensional convex body is upper bounded by <span></span><math></math>, improving on the best previous bound established by Rogers in 1959. However, for the Euclidean ball, Rogers obtained the better upper bound <span></span><math></math>, and this result was extended to certain symmetric convex bodies by Gritzmann. The constant <span></span><math></math> above is independent on <span></span><math></math>. In this paper, we show that such a bound can be achieved for more general classes of convex bodies without symmetry, including anti-blocking bodies, locally anti-blocking bodies and <span></span><math></math>-dimensional polytopes with <span></span><math></math> vertices.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146096555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We prove a conjecture of R. Oberlin and Héra on the dimension of unions of -planes. Let be integers, and . If , with , then . The proof combines a recent idea of Zahl and the Brascamp–Lieb inequality.
{"title":"Hausdorff dimension of unions of -planes","authors":"Shengwen Gan","doi":"10.1112/mtk.70071","DOIUrl":"https://doi.org/10.1112/mtk.70071","url":null,"abstract":"<p>We prove a conjecture of R. Oberlin and Héra on the dimension of unions of <span></span><math></math>-planes. Let <span></span><math></math> be integers, and <span></span><math></math>. If <span></span><math></math>, with <span></span><math></math>, then <span></span><math></math>. The proof combines a recent idea of Zahl and the Brascamp–Lieb inequality.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/mtk.70071","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146091519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pál's isominwidth theorem states that for a fixed minimal width, the regular triangle has minimal area. A spherical version of this theorem was proven by Bezdek and Blekherman, if the minimal width is at most . If the width is greater than , the regular triangle no longer minimizes the area at fixed minimal width. We show that the minimizers are instead given by the polar sets of spherical Reuleaux triangles. Moreover, stability versions of the two spherical inequalities are obtained.
{"title":"The isominwidth problem on the 2-sphere","authors":"Ansgar Freyer, Ádám Sagmeister","doi":"10.1112/mtk.70069","DOIUrl":"https://doi.org/10.1112/mtk.70069","url":null,"abstract":"<p>Pál's isominwidth theorem states that for a fixed minimal width, the regular triangle has minimal area. A spherical version of this theorem was proven by Bezdek and Blekherman, if the minimal width is at most <span></span><math></math>. If the width is greater than <span></span><math></math>, the regular triangle no longer minimizes the area at fixed minimal width. We show that the minimizers are instead given by the polar sets of spherical Reuleaux triangles. Moreover, stability versions of the two spherical inequalities are obtained.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/mtk.70069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146091246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Brjuno and Wilton functions bear a striking resemblance, despite their very different origins; while the Brjuno function is a fundamental tool in one-dimensional holomorphic dynamics, the Wilton function stems from the study of divisor sums and self-correlation functions in analytic number theory. We show that these perspectives are unified by the semi-Brjuno function . Namely, and can be expressed in terms of the even and odd parts of , respectively, up to a bounded defect. Based on numerical observations, we further analyze the arising functions and , the first of which is Hölder continuous whereas the second exhibits discontinuities at rationals, behaving similarly to the classical popcorn function.
{"title":"The Brjuno and Wilton functions","authors":"Claire Burrin, Seul Bee Lee, Stefano Marmi","doi":"10.1112/mtk.70068","DOIUrl":"https://doi.org/10.1112/mtk.70068","url":null,"abstract":"<p>The Brjuno and Wilton functions bear a striking resemblance, despite their very different origins; while the Brjuno function <span></span><math></math> is a fundamental tool in one-dimensional holomorphic dynamics, the Wilton function <span></span><math></math> stems from the study of divisor sums and self-correlation functions in analytic number theory. We show that these perspectives are unified by the semi-Brjuno function <span></span><math></math>. Namely, <span></span><math></math> and <span></span><math></math> can be expressed in terms of the even and odd parts of <span></span><math></math>, respectively, up to a bounded defect. Based on numerical observations, we further analyze the arising functions <span></span><math></math> and <span></span><math></math>, the first of which is Hölder continuous whereas the second exhibits discontinuities at rationals, behaving similarly to the classical popcorn function.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145983569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For all with , the smallest possible isoperimetric quotient of an -dimensional convex polytope that has facets is shown to be bounded from above and from below by positive universal constant multiples of . For all and , it is shown that every -dimensional origin-symmetric convex polytope that has vertices admits an affine image whose isoperimetric quotient is at most a universal constant multiple of , which is sharp. The weak isomorphic reverse isoperimetry conjecture is proved for -dimensional convex polytopes that have facets by demonstrating that any such polytope has an image under a volume-preserving matrix and a convex body such that the isoperimetric quotient of is at most a universal constant multiple of , and also is at least a positive universal constant.
{"title":"Approximate isoperimetry for convex polytopes","authors":"Keith Ball, Károly J. Böröczky, Assaf Naor","doi":"10.1112/mtk.70070","DOIUrl":"https://doi.org/10.1112/mtk.70070","url":null,"abstract":"<p>For all <span></span><math></math> with <span></span><math></math>, the smallest possible isoperimetric quotient of an <span></span><math></math>-dimensional convex polytope that has <span></span><math></math> facets is shown to be bounded from above and from below by positive universal constant multiples of <span></span><math></math>. For all <span></span><math></math> and <span></span><math></math>, it is shown that every <span></span><math></math>-dimensional origin-symmetric convex polytope that has <span></span><math></math> vertices admits an affine image whose isoperimetric quotient is at most a universal constant multiple of <span></span><math></math>, which is sharp. The weak isomorphic reverse isoperimetry conjecture is proved for <span></span><math></math>-dimensional convex polytopes that have <span></span><math></math> facets by demonstrating that any such polytope <span></span><math></math> has an image <span></span><math></math> under a volume-preserving matrix and a convex body <span></span><math></math> such that the isoperimetric quotient of <span></span><math></math> is at most a universal constant multiple of <span></span><math></math>, and also <span></span><math></math> is at least a positive universal constant.</p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2026-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145993888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We show that there exists a lattice covering of by Euclidean spheres of equal radius with density as , where
我们证明了存在由等半径密度的欧几里得球组成的晶格覆盖,其中
{"title":"New upper bound for lattice covering by spheres","authors":"Jun Gao, Xizhi Liu, Oleg Pikhurko, Shumin Sun","doi":"10.1112/mtk.70066","DOIUrl":"https://doi.org/10.1112/mtk.70066","url":null,"abstract":"<p>We show that there exists a lattice covering of <span></span><math></math> by Euclidean spheres of equal radius with density <span></span><math></math> as <span></span><math></math>, where\u0000\u0000 </p>","PeriodicalId":18463,"journal":{"name":"Mathematika","volume":"72 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/mtk.70066","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145824919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}