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
963400e5
Commit
963400e5
authored
1 year ago
by
Luke Naylor
Browse files
Options
Downloads
Patches
Plain Diff
Adjust plots and rephrase problem statement
parent
1ea1ba65
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Pipeline
#28330
passed
1 year ago
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
main.tex
+28
-16
28 additions, 16 deletions
main.tex
with
28 additions
and
16 deletions
main.tex
+
28
−
16
View file @
963400e5
...
@@ -38,6 +38,7 @@ sorting=ynt
...
@@ -38,6 +38,7 @@ sorting=ynt
\newtheorem
{
lemma
}{
Lemma
}
[section]
\newtheorem
{
lemma
}{
Lemma
}
[section]
\newtheorem
{
fact
}{
Fact
}
[section]
\newtheorem
{
fact
}{
Fact
}
[section]
\newtheorem
{
example
}{
Example
}
[section]
\newtheorem
{
example
}{
Example
}
[section]
\newtheorem
{
problem
}{
Problem Statement
}
\begin{document}
\begin{document}
...
@@ -642,22 +643,33 @@ finding all pseudo-walls when $\beta_{-}\in\QQ$. In section [ref], a different
...
@@ -642,22 +643,33 @@ finding all pseudo-walls when $\beta_{-}\in\QQ$. In section [ref], a different
algorithm will be presented making use of the later theorems in this article,
algorithm will be presented making use of the later theorems in this article,
with the goal of cutting down the run time.
with the goal of cutting down the run time.
\
subsection*
{
Problem statement
}
\
begin{problem}
[sufficiently large `left' pseudo-walls]
\label
{
subsect
:problem-statement
}
\label
{
problem
:problem-statement
-1
}
Fix a Chern character
$
v
$
with positive rank,
$
\Delta
(
v
)
\geq
0
$
,
Fix a Chern character
$
v
$
with positive rank,
$
\Delta
(
v
)
\geq
0
$
,
and
$
\beta
_{
-
}
(
v
)
\in
\QQ
$
.
and
$
\beta
_{
-
}
(
v
)
\in
\QQ
$
.
The goal is to find all Chern characters
$
u
=(
r,c
\ell
,d
\ell
^
2
)
$
which satisfy the
The goal is to find all pseudo-semistabilizers
$
u
=(
r,c
\ell
,d
\ell
^
2
)
$
conditions of lemma
\ref
{
lem:pseudo
_
wall
_
numerical
_
tests
}
using
which give circular pseudo-walls containing some fixed point
$
P
=(
\beta
_{
-
}
,
0
)
$
,
$
\chern
_
1
^{
\beta
_{
-
}}
(
v
-
u
)
\geq
0
$
, as well as the Bogomolov inequalities:
$
P
\in\Theta
_
v
^
-
$
.
$
\Delta
(
u
)
,
\Delta
(
v
-
u
)
\geq
0
$
and
$
\Delta
(
u
)+
\Delta
(
v
-
u
)
\leq
\Delta
(
v
)
$
.
With the added restriction that
$
u
$
`destabilizes'
$
v
$
moving `inwards', that is,
We want to restrict our attention to pseudo-walls left of
$
V
_
v
$
(condition (a) of
$
\nu
(
u
)
>
\nu
(
v
)
$
inside the circular pseudo-wall
lemma), because this is the side of
$
V
_
v
$
containing the chamber for Gieseker
(`outward' destabilizers can be recovered as
$
v
-
u
$
).
stable objects, and the picture on the other side should be symmetric.
Condition (c) of the lemma is there to restrict to objects most likely to
This will give all pseudo-walls between the chamber corresponding to Gieseker
semistabilizers of actual sheaves. The Chern characters which destabilize
stability and the stability condition corresponding to
$
P
$
.
`outwards' can be recovered as
$
v
-
u
$
for each solution
$
u
$
to the current
\end{problem}
problem.
\begin{problem}
[all `left' pseudo-walls]
\label
{
problem:problem-statement-1
}
Fix a Chern character
$
v
$
with positive rank,
$
\Delta
(
v
)
\geq
0
$
,
and
$
\beta
_{
-
}
(
v
)
\in
\QQ
$
.
The goal is to find all solutions
$
u
=(
r,c
\ell
,d
\ell
^
2
)
$
to problem
\ref
{
problem:problem-statement-1
}
with the choice
$
P
=(
\beta
_{
-
}
,
0
)
$
.
This will give all circular pseudo-walls left of
$
V
_
v
$
.
\end{problem}
\subsection*
{
Algorithm
}
\subsection*
{
Algorithm
}
...
@@ -1310,14 +1322,14 @@ def plot_d_bound(
...
@@ -1310,14 +1322,14 @@ def plot_d_bound(
\centering
\centering
\begin{subfigure}
{
.45
\textwidth
}
\begin{subfigure}
{
.45
\textwidth
}
\centering
\centering
\sageplot
[width=\linewidth]
{
plot
_
d
_
bound(v
_
example, 0)
}
\sageplot
[width=\linewidth]
{
plot
_
d
_
bound(v
_
example, 0
, ymin=-0.5
)
}
\caption
{$
q
=
0
$
(all bounds other than green coincide on line)
}
\caption
{$
q
=
0
$
(all bounds other than green coincide on line)
}
\label
{
fig:d
_
bounds
_
xmpl
_
min
_
q
}
\label
{
fig:d
_
bounds
_
xmpl
_
min
_
q
}
\end{subfigure}
%
\end{subfigure}
%
\hfill
\hfill
\begin{subfigure}
{
.45
\textwidth
}
\begin{subfigure}
{
.45
\textwidth
}
\centering
\centering
\sageplot
[width=\linewidth]
{
plot
_
d
_
bound(v
_
example, 4, ymin=-3)
}
\sageplot
[width=\linewidth]
{
plot
_
d
_
bound(v
_
example, 4, ymin=-3
, ymax=3
)
}
\caption
{$
q
=
\chern
^{
\beta
}
(
F
)
$
(all bounds other than blue coincide on line)
}
\caption
{$
q
=
\chern
^{
\beta
}
(
F
)
$
(all bounds other than blue coincide on line)
}
\label
{
fig:d
_
bounds
_
xmpl
_
max
_
q
}
\label
{
fig:d
_
bounds
_
xmpl
_
max
_
q
}
\end{subfigure}
\end{subfigure}
...
@@ -1365,7 +1377,7 @@ Some of the details around the associated numerics are explored next.
...
@@ -1365,7 +1377,7 @@ Some of the details around the associated numerics are explored next.
\centering
\centering
\sageplot
[
\sageplot
[
width=
\linewidth
width=
\linewidth
]
{
plot
_
d
_
bound(v
_
example, 2, ymax=
6
, ymin=-2, aspect
_
ratio=1)
}
]
{
plot
_
d
_
bound(v
_
example, 2, ymax=
4
, ymin=-2, aspect
_
ratio=1)
}
\caption
{
\caption
{
Bounds on
$
d:
=
\chern
_
2
(
E
)
$
in terms of
$
r:
=
\chern
_
0
(
E
)
$
for a fixed
Bounds on
$
d:
=
\chern
_
2
(
E
)
$
in terms of
$
r:
=
\chern
_
0
(
E
)
$
for a fixed
value
$
\chern
_
1
^{
\beta
}
(
F
)/
2
$
of
$
q:
=
\chern
_
1
^{
\beta
}
(
E
)
$
.
value
$
\chern
_
1
^{
\beta
}
(
F
)/
2
$
of
$
q:
=
\chern
_
1
^{
\beta
}
(
E
)
$
.
...
...
This diff is collapsed.
Click to expand it.
Luke Naylor
@s1511002
mentioned in issue
#13 (closed)
·
1 year ago
mentioned in issue
#13 (closed)
mentioned in issue #13
Toggle commit list
Luke Naylor
@s1511002
mentioned in issue
#11 (closed)
·
1 year ago
mentioned in issue
#11 (closed)
mentioned in issue #11
Toggle commit list
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