112,716 research outputs found
Notes on lattice points of zonotopes and lattice-face polytopes
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
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
For a finite abelian group the plus-minus weighted Davenport
constant, denoted , is the smallest such that each
sequence over has a weighted zero-subsum with weights +1
and -1, i.e., there is a non-empty subset such that
for . 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
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
๊ท ์ง๊ณต๊ฐ์์์ ๋์ญํ๊ณผ ๋์คํํด ๊ทผ์ฌ
ํ์๋
ผ๋ฌธ(๋ฐ์ฌ) -- ์์ธ๋ํ๊ต๋ํ์ : ์์ฐ๊ณผํ๋ํ ์๋ฆฌ๊ณผํ๋ถ, 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
We say that a graph has the Ramsey property w.r.t.\ some graph and
some integer , or is -Ramsey for short, if any -coloring
of the edges of contains a monochromatic copy of . R{\"o}dl and
Ruci{\'n}ski asked how globally sparse -Ramsey graphs can possibly
be, where the density of is measured by the subgraph with
the highest average degree. So far, this so-called Ramsey density is known only
for cliques and some trivial graphs . In this work we determine the Ramsey
density up to some small error terms for several cases when is a complete
bipartite graph, a cycle or a path, and colors are available
- โฆ