Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
M
Max Destabilizer Rank
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
luke naylor latex documents
research
Max Destabilizer Rank
Commits
bf1d19cf
Commit
bf1d19cf
authored
1 year ago
by
Luke Naylor
Browse files
Options
Downloads
Patches
Plain Diff
Start formatting result about new eps into theorem/dfn
parent
d4910357
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
main.tex
+34
-3
34 additions, 3 deletions
main.tex
with
34 additions
and
3 deletions
main.tex
+
34
−
3
View file @
bf1d19cf
...
@@ -24,6 +24,7 @@
...
@@ -24,6 +24,7 @@
\newcommand
{
\minorheading
}
[1]
{{
\noindent\normalfont\normalsize\bfseries
#1
}}
\newcommand
{
\minorheading
}
[1]
{{
\noindent\normalfont\normalsize\bfseries
#1
}}
\newtheorem
{
theorem
}{
Theorem
}
[section]
\newtheorem
{
theorem
}{
Theorem
}
[section]
\newtheorem
{
lemmadfn
}{
Lemma/Definition
}
[section]
\begin{document}
\begin{document}
...
@@ -985,7 +986,36 @@ rhs_numerator = (
...
@@ -985,7 +986,36 @@ rhs_numerator = (
\noindent
\noindent
Let
$
\aa
^{
'
}$
be an integer representative of
$
\aa
^{
-
1
}$
in
$
\ZZ
/
n
\ZZ
$
.
Let
$
\aa
^{
'
}$
be an integer representative of
$
\aa
^{
-
1
}$
in
$
\ZZ
/
n
\ZZ
$
.
Considering the following tautology:
Next, we seek to find a larger
$
\epsilon
$
to use in place of
$
\epsilon
_
F
$
in the
proof of theorem
\ref
{
thm:rmax
_
with
_
uniform
_
eps
}
:
\begin{lemmadfn}
[
Finding better alternatives to
$
\epsilon
_
F
$
:
$
\epsilon
_
q
^
1
$
and
$
\epsilon
_
q
^
1
$
]
Suppose
$
d
\in
\frac
{
1
}{
m
}
\ZZ
$
is satisfies the condition in
eqn
\ref
{
eqn:positive
_
rad
_
condition
_
in
_
terms
_
of
_
q
_
beta
}
.
That is:
\begin{equation*}
\sage
{
positive
_
radius
_
condition.subs([q
_
value
_
expr,beta
_
value
_
expr]).factor()
}
\end{equation*}
\noindent
Then we have:
\begin{equation*}
d -
\frac
{
(
\aa
r + 2
\bb
)
\aa
}{
2n
^
2
}
\geq
\epsilon
_
q
^
2
\geq
\epsilon
_
q
^
1 > 0
\end{equation*}
Where
$
\epsilon
_
q
^
1
$
and
$
\epsilon
_
q
^
2
$
are defined as follows:
\end{lemmadfn}
\begin{proof}
Consider the following tautology:
\begin{align}
\begin{align}
&
\frac
{
x
}{
m
}
&
\frac
{
x
}{
m
}
...
@@ -1021,12 +1051,12 @@ Considering the following tautology:
...
@@ -1021,12 +1051,12 @@ Considering the following tautology:
\label
{
eqn:better
_
eps
_
problem
_
k
_
mod
_
n
}
\label
{
eqn:better
_
eps
_
problem
_
k
_
mod
_
n
}
\end{align}
\end{align}
In our situation, we want to find
the
gap between the right-hand-side of eqn
In our situation, we want to find
a
gap between the right-hand-side of eqn
\ref
{
eqn:positive
_
rad
_
condition
_
in
_
terms
_
of
_
q
_
beta
}
,
\ref
{
eqn:positive
_
rad
_
condition
_
in
_
terms
_
of
_
q
_
beta
}
,
and the least element of
$
\frac
{
1
}{
m
}
\ZZ
$
which is strictly greater.
and the least element of
$
\frac
{
1
}{
m
}
\ZZ
$
which is strictly greater.
This amounts to finding the least
$
k
\in
\ZZ
_{
>
0
}$
for which
This amounts to finding the least
$
k
\in
\ZZ
_{
>
0
}$
for which
eqn
\ref
{
eqn:finding
_
better
_
eps
_
problem
}
holds.
eqn
\ref
{
eqn:finding
_
better
_
eps
_
problem
}
holds.
Since such a
$
k
$
satisf
ies
eqn
\ref
{
eqn:better
_
eps
_
problem
_
k
_
mod
_
n
}
,
Since such a
$
k
$
must also
satisf
y
eqn
\ref
{
eqn:better
_
eps
_
problem
_
k
_
mod
_
n
}
,
we can pick the smallest
$
k
\in
\ZZ
_{
>
0
}$
which satisfies this new condition
we can pick the smallest
$
k
\in
\ZZ
_{
>
0
}$
which satisfies this new condition
(a computation only depending on
$
q
$
and
$
\beta
$
, but not
$
r
$
)
(a computation only depending on
$
q
$
and
$
\beta
$
, but not
$
r
$
)
and we are then guaranteed that the gap is at least
$
\frac
{
k
}{
2
mn
^
2
}$
.
and we are then guaranteed that the gap is at least
$
\frac
{
k
}{
2
mn
^
2
}$
.
...
@@ -1036,6 +1066,7 @@ $k \in \ZZ_{>0}$ satisfying eqn \ref{eqn:better_eps_problem_k_mod_gcd2n2_a2mn}
...
@@ -1036,6 +1066,7 @@ $k \in \ZZ_{>0}$ satisfying eqn \ref{eqn:better_eps_problem_k_mod_gcd2n2_a2mn}
instead, but at the cost of computing several
$
\gcd
$
's and modulo reductions
instead, but at the cost of computing several
$
\gcd
$
's and modulo reductions
for each
$
q
$
considered.
for each
$
q
$
considered.
\end{proof}
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment