112,716 research outputs found

    Notes on lattice points of zonotopes and lattice-face polytopes

    Get PDF
    Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point enumerator of a convex body. In this context we are interested in bounds on the coefficients of Ehrhart polynomials of lattice polytopes via the successive minima. Our results for lattice zonotopes and lattice-face polytopes imply, in particular, that for 0-symmetric lattice-face polytopes and lattice parallelepipeds the volume can be replaced by the lattice point enumerator.Comment: 16 pages, incorporated referee remarks, corrected proof of Theorem 1.2, added new co-autho

    Simultaneous Arithmetic Progressions on Algebraic Curves

    Full text link
    A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the length of an s.a.p. on an elliptic curve in Weierstrass form over Q. We show that 4319 is such a bound for curves over R. This is done by considering translates of the curve in a grid as a graph. A simple upper bound is found for the number of crossings and the 'crossing inequality' gives a lower bound. Together these bound the length of an s.a.p. on the curve. We then use a similar method to extend the result to arbitrary real algebraic curves. Instead of considering s.a.p.'s we consider k^2/3 points in a grid. The number of crossings is bounded by Bezout's Theorem. We then give another proof using a result of Jarnik bounding the number of grid points on a convex curve. This result applies as any real algebraic curve can be broken up into convex and concave parts, the number of which depend on the degree. Lastly, these results are extended to complex algebraic curves.Comment: 11 pages, 6 figures, order of email addresses corrected 12 pages, closing remarks, a reference and an acknowledgment adde

    Remarks on the plus-minus weighted Davenport constant

    Full text link
    For (G,+)(G,+) a finite abelian group the plus-minus weighted Davenport constant, denoted Dยฑ(G)\mathsf{D}_{\pm}(G), is the smallest โ„“\ell such that each sequence g1...gโ„“g_1 ... g_{\ell} over GG has a weighted zero-subsum with weights +1 and -1, i.e., there is a non-empty subset IโŠ‚{1,...,โ„“}I \subset \{1,..., \ell\} such that โˆ‘iโˆˆIaigi=0\sum_{i \in I} a_i g_i =0 for aiโˆˆ{+1,โˆ’1}a_i \in \{+1,-1\}. We present new bounds for this constant, mainly lower bounds, and also obtain the exact value of this constant for various additional types of groups

    On the weak order of Coxeter groups

    Full text link
    This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to whether the set of initial sections of reflection orders, ordered by inclusion, forms a complete lattice. Meet and join in weak order are described in terms of a suitable closure operator. Galois connections are defined from the power set of W to itself, under which maximal subgroups of certain groupoids correspond to certain complete meet subsemilattices of weak order. An analogue of weak order for standard parabolic subsets of any rank of the root system is defined, reducing to the usual weak order in rank zero, and having some analogous properties in rank one (and conjecturally in general).Comment: 37 pages, submitte

    ๊ท ์งˆ๊ณต๊ฐ„์—์„œ์˜ ๋™์—ญํ•™๊ณผ ๋””์˜คํŒํ‹ด ๊ทผ์‚ฌ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ์ž์—ฐ๊ณผํ•™๋Œ€ํ•™ ์ˆ˜๋ฆฌ๊ณผํ•™๋ถ€, 2022. 8. ์ž„์„ ํฌ.Dynamics of group actions on homogeneous spaces, which is referred to as "homogeneous dynamics", has a lot of connections to number theory. These connections have been intensively and extensively studied over the past decades, and have produced various and abundant number-theoretic results. In this thesis, we focus on the relationship between homogeneous dynamics and Diophantine approximation, and consider the following three objects in Diophantine approximation: Dirichlet non-improvable affine forms, badly approximable affine forms, and weighted singular vectors. We improve equidistribution results in homogeneous dynamics in terms of weak L1 estimates, and establish local ubiquity systems for Dirichlet non-improvable affine forms using Transference Principle in Diophantine approximation. These developments imply zero-infinite phenomena for Hausdorff measures of Dirichlet non-improvable affine forms. Next, we establish an effective version of entropy rigidity, which implies the effective upper bound of Hausdorff dimension of badly approximable affine forms by constructing "well-behaved" ฯƒ-algebras and certain invariant measures with large entropy. We further characterize full Hausdorff-dimensionality of badly approximable affine forms for fixed matrix by a Diophantine condition of singularity on average. We also consider Diophantine approximation over global function fields and have similar results in this setting. Finally, we improve lattice point counting in geometry of numbers, which arises from the fractal structure of weighted singular vectors. Combining the improvement and the shadowing property in homogeneous dynamics, we obtain the sharp lower bound of Hausdorff dimension of weighted singular vectors.๊ท ์งˆ๊ณต๊ฐ„์—์„œ ๊ตฐ ์ž‘์šฉ์˜ ๋™์—ญํ•™์„ ์˜๋ฏธํ•˜๋Š” ๊ท ์งˆ๋™์—ญํ•™์€ ์ •์ˆ˜๋ก ๊ณผ ๋งŽ์€ ์—ฐ๊ฒฐ๊ด€๊ณ„๊ฐ€ ์žˆ๋‹ค. ์ด๋Ÿฌํ•œ ์—ฐ๊ฒฐ๊ด€๊ณ„๋Š” ์ง€๋‚œ ์ˆ˜์‹ญ ๋…„๊ฐ„ ๊ด‘๋ฒ”์œ„ํ•˜๊ณ  ์ง‘์ค‘์ ์œผ๋กœ ์—ฐ๊ตฌ๋˜์—ˆ์œผ๋ฉฐ ๋‹ค์–‘ํ•œ ์ •์ˆ˜๋ก  ๊ฒฐ๊ณผ๋ฅผ ์ œ๊ณตํ•˜์˜€๋‹ค. ๋ณธ ํ•™์œ„ ๋…ผ๋ฌธ์—์„œ๋Š” ๊ท ์งˆ๋™์—ญํ•™๊ณผ ๋””์˜คํŒํ‹ด ๊ทผ์‚ฌ์˜ ๊ด€๊ณ„์— ๋Œ€ํ•ด ์‚ดํŽด๋ณด๊ณ  ๋‹ค์Œ๊ณผ ๊ฐ™์€ ๋””์˜คํŒํ‹ด ๊ทผ์‚ฌ์—์„œ์˜ ์„ธ๊ฐ€์ง€ ๋Œ€์ƒ์— ๋Œ€ํ•ด ์•Œ์•„๋ณผ ๊ฒƒ์ด๋‹ค: ๋””๋ฆฌ๋Œ๋ ˆ ํ–ฅ์ƒ ๋ถˆ๊ฐ€๋Šฅ ์•„ํ•€ํ˜•์‹, ๋‚˜์œ ๊ทผ์‚ฌ๋ฅผ ๊ฐ€์ง€๋Š” ์•„ํ•€ํ˜•์‹, ๊ฐ€์ค‘์น˜๋ฅผ ๊ฐ€์ง€๋Š” ํŠน์ด ๋ฒกํ„ฐ. ์šฐ์„  ์šฐ๋ฆฌ๋Š” ์•ฝํ•œ L1 ์ธก์ •์„ ํ†ตํ•ด ๊ท ์งˆ๋™์—ญํ•™์—์„œ์˜ ๋™๋“ฑ๋ถ„ํฌ ๊ฒฐ๊ณผ๋ฅผ ํ–ฅ์ƒ์‹œํ‚ค๊ณ  ๋””์˜คํŒํ‹ด ๊ทผ์‚ฌ์—์„œ์˜ ์ „์ด์›๋ฆฌ๋ฅผ ์ด์šฉํ•˜์—ฌ ๋””๋ฆฌ๋Œ๋ ˆ ํ–ฅ์ƒ ๋ถˆ๊ฐ€๋Šฅ ์•„ํ•€ํ˜•์‹์— ๋Œ€ํ•œ ๊ตญ์†Œ ํŽธ์žฌ ์ฒด๊ณ„๋ฅผ ๊ตฌ์ถ•ํ•œ๋‹ค. ์ด๋Ÿฌํ•œ ์—ฐ๊ตฌ๋ฅผ ๋ฐ”ํƒ•์œผ๋กœ ๋””๋ฆฌ๋Œ๋ ˆ ํ–ฅ์ƒ ๋ถˆ๊ฐ€๋Šฅ ์•„ํ•€ํ˜•์‹์˜ ํ•˜์šฐ์Šค๋„๋ฅดํ”„ ์ธก๋„์— ๋Œ€ํ•œ 0 โˆ’ โˆž ํ˜„์ƒ์„ ๊ทœ๋ช…ํ•œ๋‹ค. ๋‹ค์Œ์œผ๋กœ ์—”ํŠธ๋กœํ”ผ ๊ฐ•์ง์„ฑ์˜ ํšจ๊ณผ์ ์ธ ํ‘œํ˜„์„ ๊ฑด์„คํ•˜๋Š”๋ฐ ์ด๋ฅผ ์ด์šฉํ•˜์—ฌ ์ž˜ ํ–‰๋™ํ•˜๋Š” ์‹œ๊ทธ๋งˆ ๋Œ€์ˆ˜๋ฅผ ๊ฑด์„คํ•˜๊ณ  ํฐ ์—”ํŠธ๋กœํ”ผ๋ฅผ ๊ฐ€์ง€๋Š” ๋ถˆ๋ณ€์ธก๋„๋ฅผ ๊ฑด์„คํ•จ์œผ๋กœ์จ ๋‚˜์œ ๊ทผ์‚ฌ๋ฅผ ๊ฐ€์ง€๋Š” ์•„ํ•€ํ˜•์‹์˜ ํ•˜์šฐ์Šค๋„๋ฅดํ”„ ์ฐจ์›์˜ ํšจ๊ณผ์ ์ธ ์ƒ๊ณ„๋ฅผ ์–ป๋Š”๋‹ค. ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ ๋‚˜์œ ๊ทผ์‚ฌ๋ฅผ ๊ฐ€์ง€๋Š” ์•„ํ•€ํ˜•์‹์ด ์ตœ๋Œ€์ฐจ์›์„ ๊ฐ–๊ธฐ ์œ„ํ•œ ํ•„์š”์ถฉ๋ถ„์กฐ๊ฑด์œผ๋กœ ํ‰๊ท ์  ํŠน์ด์„ฑ์„ ๋ณด์ธ๋‹ค. ๋˜ํ•œ ๋Œ€์—ญ์  ํ•จ์ˆ˜์ฒด ์œ„์—์„œ์˜ ๋””์˜คํŒํ‹ด ๊ทผ์‚ฌ๋ฅผ ์ƒ๊ฐํ•˜๊ณ  ๋น„์Šทํ•œ ๊ฒฐ๊ณผ๋ฅผ ์–ป๋Š”๋‹ค. ๋งˆ์ง€๋ง‰์œผ๋กœ ๊ฐ€์ค‘์น˜๋ฅผ ๊ฐ€์ง€๋Š” ํŠน์ด ๋ฒกํ„ฐ์˜ ํ”„๋ž™ํƒˆ ๊ตฌ์กฐ์™€ ๊ด€๋ จ๋œ ์ˆ˜์˜ ๊ธฐํ•˜ํ•™์˜ ๊ฒฉ์ž์  ์…ˆ์„ ๋ฐœ์ „์‹œํ‚ค๊ณ  ๊ท ์งˆ๋™์—ญํ•™์˜ ํˆฌ์˜ ์„ฑ์งˆ์„ ์ด์šฉํ•˜์—ฌ ๊ฐ€์ค‘์น˜๋ฅผ ๊ฐ€์ง€๋Š” ํŠน์ด ๋ฒกํ„ฐ์˜ ํ•˜์šฐ์Šค๋„๋ฅดํ”„ ์ฐจ์›์˜ ํ•˜๊ณ„๋ฅผ ์–ป๋Š”๋‹ค.Abstract i 1 Introduction 1 1.1 Dirichlet non-improvable affine forms 3 1.2 Badly approximable affine forms 7 1.3 Badly approximable affine forms over global function field 10 1.4 Weighted singular vectors 12 2 Equidistribution and Ubiquitous system 16 2.1 Preliminaries 16 2.1.1 Hausdorff measure and auxiliary lemmas 16 2.1.2 Homogeneous dynamics 17 2.2 Equidistribution and Weak-L1 estimate 21 2.3 Application to Diophantine approximation 23 2.3.1 Successive minima function 23 2.3.2 The number of covering balls 24 2.4 Local ubiquitous system 27 2.4.1 Historical Remarks 27 2.4.2 Transference Principle on Diophantine approximation 28 2.4.3 Mass distributions on ฮจฯต-approximable matrices 30 2.4.4 Establishing the local ubiquity 33 3 Entropy rigidity and Best approximation vectors 50 3.1 General entropy theory 50 3.2 Entropy on homogeneous spaces 53 3.2.1 General setup 53 3.2.2 Construction of a-descending, subordinate algebra and its entropy properties 55 3.2.3 Effective variational principle 67 3.3 Preliminaries for the upper bound 70 3.3.1 Dimensions with quasinorms 71 3.3.2 Correspondence with dynamics 72 3.3.3 Covering counting lemma 73 3.4 Upper bound for Hausdorff dimension of BadA(ฯต) 76 3.4.1 Constructing measure with entropy lower bound 77 3.4.2 The proof of Theorem 1.2.2 82 3.5 Upper bound for Hausdorff dimension of Badb(ฯต) 87 3.5.1 Constructing measure with entropy lower bound 87 3.5.2 Effective equidistribution and the proof of Theorem 1.2.1 96 3.6 Characterization of singular on average property and Dimension esitimates 103 3.6.1 Best approximations 103 3.6.2 Characterization of singular on average property 104 3.6.3 Modified Bugeaud-Laurent sequence 108 3.6.4 Dimension estimates 115 4 Diophantine approximation over global function fields 117 4.1 Background material for the lower bound 117 4.1.1 On global function fields 117 4.1.2 On the geometry of numbers and Dirichletโ€™s theorem 119 4.1.3 Best approximation sequences with weights 121 4.1.4 Transference theorems with weights 125 4.2 Characterisation of singular on average property 130 4.3 Full Hausdorff dimension for singular on average matrices 133 4.3.1 Modified Bugeaud-Zhang sequences 133 4.3.2 Lower bound on the Hausdorff dimension of BadA(ฯต) 141 4.3.3 Proof that Assertion (2) implies Assertion (1) in Theorem 1.3.1 148 4.4 Background material for the upper bound 149 4.4.1 Homogeneous dynamics 149 4.4.2 Dani correspondence 152 4.4.3 Entropy, partition construction, and effective variational principle 155 4.5 Upper bound on the Hausdorff dimension of BadA(ฯต) 167 4.5.1 Constructing measures with large entropy 167 4.5.2 Effective upper bound on dimH BadA(ฯต) 175 5 Weighted singular vectors 183 5.1 Fractal sutructure and Hausdorff dimension 183 5.1.1 Fractal structure 183 5.1.2 Self-affine structure and lower bound 184 5.2 Counting lattice points in convex sets 193 5.2.1 Preliminaries for lattice point counting 193 5.2.2 Lattice point counting in Rd+1 195 5.3 Lower bound 206 5.3.1 Construction of the fractal set 206 5.3.2 The lower bound calculation 212 Abstract (in Korean) 225 Acknowledgement (in Korean) 226๋ฐ•

    On globally sparse Ramsey graphs

    Full text link
    We say that a graph GG has the Ramsey property w.r.t.\ some graph FF and some integer rโ‰ฅ2r\geq 2, or GG is (F,r)(F,r)-Ramsey for short, if any rr-coloring of the edges of GG contains a monochromatic copy of FF. R{\"o}dl and Ruci{\'n}ski asked how globally sparse (F,r)(F,r)-Ramsey graphs GG can possibly be, where the density of GG is measured by the subgraph HโŠ†GH\subseteq G with the highest average degree. So far, this so-called Ramsey density is known only for cliques and some trivial graphs FF. In this work we determine the Ramsey density up to some small error terms for several cases when FF is a complete bipartite graph, a cycle or a path, and rโ‰ฅ2r\geq 2 colors are available
    • โ€ฆ
    corecore