This document discusses conjectures relating singularities of wild quotient singularities to arithmetic properties of Galois representations, known as the wild McKay correspondence. Specifically, it conjectures that a stringy invariant of the singularity equals a weighted count of continuous Galois representations of the local field into the finite group. It describes known cases that verify the conjecture, possible applications, and future work needed to fully establish the conjectures, such as developing motivic integration over wild stacks.
The Probability that a Matrix of Integers Is DiagonalizableJay Liew
The Probability that a
Matrix of Integers Is Diagonalizable
Andrew J. Hetzel, Jay S. Liew, and Kent E. Morrison
1. INTRODUCTION. It is natural to use integer matrices for examples and exercises
when teaching a linear algebra course, or, for that matter, when writing a textbook in
the subject. After all, integer matrices offer a great deal of algebraic simplicity for particular
problems. This, in turn, lets students focus on the concepts. Of course, to insist
on integer matrices exclusively would certainly give the wrong idea about many important
concepts. For example, integer matrices with integer matrix inverses are quite
rare, although invertible integer matrices (over the rational numbers) are relatively
common. In this article, we focus on the property of diagonalizability for integer matrices
and pose the question of the likelihood that an integer matrix is diagonalizable.
Specifically, we ask: What is the probability that an n × n matrix with integer entries is
diagonalizable over the complex numbers, the real numbers, and the rational numbers,
respectively?
The second Fundamental Theorem of Calculus makes calculating definite integrals a problem of antidifferentiation!
(the slideshow has extra examples based on what happened in class)
The Probability that a Matrix of Integers Is DiagonalizableJay Liew
The Probability that a
Matrix of Integers Is Diagonalizable
Andrew J. Hetzel, Jay S. Liew, and Kent E. Morrison
1. INTRODUCTION. It is natural to use integer matrices for examples and exercises
when teaching a linear algebra course, or, for that matter, when writing a textbook in
the subject. After all, integer matrices offer a great deal of algebraic simplicity for particular
problems. This, in turn, lets students focus on the concepts. Of course, to insist
on integer matrices exclusively would certainly give the wrong idea about many important
concepts. For example, integer matrices with integer matrix inverses are quite
rare, although invertible integer matrices (over the rational numbers) are relatively
common. In this article, we focus on the property of diagonalizability for integer matrices
and pose the question of the likelihood that an integer matrix is diagonalizable.
Specifically, we ask: What is the probability that an n × n matrix with integer entries is
diagonalizable over the complex numbers, the real numbers, and the rational numbers,
respectively?
The second Fundamental Theorem of Calculus makes calculating definite integrals a problem of antidifferentiation!
(the slideshow has extra examples based on what happened in class)
i give some indeas on how to use asymptotic series and expansion to prove Riemann Hypothesis, solve integral equations and even define a regularized integral of powers
Cusps of the Kähler moduli space and stability conditions on K3 surfacesHeinrich Hartmann
Presentation about the paper with the same title http://arxiv.org/abs/1012.3121
Abstract:
In [Ma1] S. Ma established a bijection between Fourier--Mukai partners of a K3 surface and cusps of the K\"ahler moduli space. The K\"ahler moduli space can be described as a quotient of Bridgeland's stability manifold. We study the relation between stability conditions σ near to a cusp and the associated Fourier--Mukai partner Y in the following ways. (1) We compare the heart of σ to the heart of coherent sheaves on Y. (2) We construct Y as moduli space of σ-stable objects.
An appendix is devoted to the group of auto-equivalences of the derived category which respect the component Stab†(X) of the stability manifold
We study QPT (quasi-polynomial tractability) in the worst case setting of linear tensor product problems defined over Hilbert spaces. We prove QPT for algorithms that use only function values under three assumptions'
1. the minimal errors for the univariate case decay polynomially fast to zero,
2. the largest singular value for the univariate case is simple,
3. the eigenfunction corresponding to the largest singular value is a multiple of the function value at some point.
The first two assumptions are necessary for QPT. The third assumption is necessary for QPT for some Hilbert spaces.
Joint work with Erich Novak
A crystallographic group is a group acting on R^n that contains a translation subgroup Z^n as a finite index subgroup. Here we consider which Coxeter groups are crystallographic groups. We also expose the enumeration in dimension 2 and 3. Then we shortly give the principle under which the enumeration of N dimensional crystallographic groups is done.
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesSEENET-MTP
Balkan Workshop BW2013
Beyond the Standard Models
25 – 29 April, 2013, Vrnjačka Banja, Serbia
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
i give some indeas on how to use asymptotic series and expansion to prove Riemann Hypothesis, solve integral equations and even define a regularized integral of powers
Cusps of the Kähler moduli space and stability conditions on K3 surfacesHeinrich Hartmann
Presentation about the paper with the same title http://arxiv.org/abs/1012.3121
Abstract:
In [Ma1] S. Ma established a bijection between Fourier--Mukai partners of a K3 surface and cusps of the K\"ahler moduli space. The K\"ahler moduli space can be described as a quotient of Bridgeland's stability manifold. We study the relation between stability conditions σ near to a cusp and the associated Fourier--Mukai partner Y in the following ways. (1) We compare the heart of σ to the heart of coherent sheaves on Y. (2) We construct Y as moduli space of σ-stable objects.
An appendix is devoted to the group of auto-equivalences of the derived category which respect the component Stab†(X) of the stability manifold
We study QPT (quasi-polynomial tractability) in the worst case setting of linear tensor product problems defined over Hilbert spaces. We prove QPT for algorithms that use only function values under three assumptions'
1. the minimal errors for the univariate case decay polynomially fast to zero,
2. the largest singular value for the univariate case is simple,
3. the eigenfunction corresponding to the largest singular value is a multiple of the function value at some point.
The first two assumptions are necessary for QPT. The third assumption is necessary for QPT for some Hilbert spaces.
Joint work with Erich Novak
A crystallographic group is a group acting on R^n that contains a translation subgroup Z^n as a finite index subgroup. Here we consider which Coxeter groups are crystallographic groups. We also expose the enumeration in dimension 2 and 3. Then we shortly give the principle under which the enumeration of N dimensional crystallographic groups is done.
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein SpacesSEENET-MTP
Balkan Workshop BW2013
Beyond the Standard Models
25 – 29 April, 2013, Vrnjačka Banja, Serbia
M. Visinescu: Hidden Symmetries of the Five-dimensional Sasaki - Einstein Spaces
Lecture by prof. dr Neven Bilic from the Ruđer Bošković Institute (Zagreb, Croatia) at the Faculty of Science and Mathematics (Niš, Serbia) on October 29, 2014.
The visit took place in the frame of the ICTP – SEENET-MTP project PRJ-09 “Cosmology and Strings”.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
Perspectives on the wild McKay correspondence
1. Perspectives on the wild McKay correspondence
Takehiko Yasuda
Osaka University
1 / 21
2. Plan of the talk
Partly a joint work with Melanie Wood.
1. What is the McKay correspondence?
2. Motivation
3. The wild McKay correspondence conjectures
4. Relation between the weight function and the Artin/Swan
conductors
5. The Hilbert scheme of points vs Bhargava’s mass formula
6. Known cases
7. Possible applications
8. Future tasks
2 / 21
3. References
1. T. Yasuda, The p-cyclic McKay correspondence via motivic integration.
arXiv:1208.0132, to appear in Compositio Mathematica.
2. T. Yasuda, Toward motivic integration over wild Deligne-Mumford stacks.
arXiv:1302.2982, to appear in the proceedings of “Higher Dimensional
Algebraic Geometry - in honour of Professor Yujiro Kawamata’s sixtieth
birthday".
3. M.M. Wood and T. Yasuda, Mass formulas for local Galois
representations and quotient singularities I: A comparison of counting
functions.
arXiv:1309:2879.
3 / 21
4. What is the McKay correspondence?
A typical form of the McKay correspondence
For a finite subgroup G ⊂ GLn(C), the same invarinat arises in two
totally different ways:
Singularities a resolution of singularities of Cn/G
Algebra the representation theory of G and the given
representation G → GLn(C)
4 / 21
5. For example,
Theorem (Batyrev)
Suppose
G is small ( pseudo-refections), and
∃ a crepant resolution Y → X := Cn/G (i.e. KY /X = 0) .
Define
e(Y ) := the topological Euler characteristic of Y .
Then
e(Y ) = {conj. classes in G} = {irred. rep. of G}.
5 / 21
6. Motivation
Today’s problem
What happens in positive characteristic? In particular, in the case
where the characteristic divides G (the :::
wild case).
Motivation
To understand singularities in positive characteristic.
wild quotient singularities = typical “bad” singularities, and a
touchstone ( ) in the study of singularities in positive
characteristic.
[de Jong]: for any variety X over k = ¯k, ∃ a set-theoretic
modification Y → X (i.e. an alteration with K(Y )/K(X)
purely insep.) with Y having only quotient singularities.
6 / 21
7. The wild McKay correspondence conjectures
For a perfect field k, let G ⊂ GLn(k) be a finite subgroup.
Roughly speaking, the wild McKay correspondence conjecture is an
equality between:
Singularities a stringy invariant of An
k/G.
Arithmetics a weighted count of continuous homomorphisms
Gk((t)) → G with Gk((t)) the absolute Galois group of
k((t)). Equivalently a weighted count of etale
G-extensions of k((t)).
7 / 21
8. One precise version:
Conjecture 1 (Wood-Y)
k = Fq
G ⊂ GLn(k): a small finite subgroup
Y
f
−→ X := An
k/G: a crepant resolution
0 ∈ X: the origin
Then
(f −1
(0)(k)) =
1
G
ρ∈Homcont (Gk((t)),G)
qw(ρ)
.
Here w is the ::::::
weight::::::::
function associated to the representation
G → GLn(k), which measures the ramification of ρ.
8 / 21
9. More generally:
Conjecture 1’ (Wood-Y)
K is a local field with residue field k = Fq
G ⊂ GLn(OK ): a small finite subgroup
Y
f
−→ X := An
OK
/G: a crepant resolution
0 ∈ X(k): the origin
Then
(f −1
(0)(k)) =
1
G
ρ∈Homcont (GK ,G)
qw(ρ)
.
9 / 21
10. The motivic and more general version:
Conjecture 2 (Y, Wood-Y)
K is a complete discrete valuation field with ::::::
perfect residue
field k
G ⊂ GLn(OK ): a small finite subgroup
Y
f
−→ X := An
OK
/G: a crepant resolution
0 ∈ X(k): the origin
Then
Mst(X)0 =
ˆ
MK
Lw
in a modified K0(Vark).
Here
MK : the conjectural moduli space of G-covers of Spec K
defined over k.
Mst(X)0: the stringy motif of X at 0.
10 / 21
11. Remarks
If K = C((t)) and G ⊂ GLn(C), then MK consists of finitely
many points corresponding to conjugacy classes in G, and the
RHS is of the form
g∈Conj(G)
Lw(g)
.
We recover Batyrev and Denef-Loeser’s results.
Both sides of the equality might be ∞ (the defining motivic
integral diverges).If X has a log resolution, then this happens
iff X is not log terminal. Wild quotient singularities are NOT
log terminal in general.
Conjectures would follow if the theory of motivic integration
over wild DM stacks is established.
11 / 21
12. More remarks
The assumption that the action is linear is important.
The assumption that G is small can be removed by considering
the stringy invariant of a ::
log variety (X, ∆) with ∆ a Q-divisor.
The ultimately general form:let (X, ∆) and (X , ∆ ) be two
K-equivalent log DM stacks and W ⊂ X and W ⊂ X
corresponding subsets. Then
Mst(X, ∆)W = Mst(X , ∆ )W .
(Y-: the tame case with a base k (not OK ))
12 / 21
13. Relation between the weight function and the Artin/Swan
conductors
Definition (the weight function (Y, Wood-Y))
ρ ↔ L/K the corresponding etale G-extension
Two G-actions on O⊕n
L :
the G-action on L induces the diagonal G-action on O⊕n
L ,
the induced representation G → GLn(OK ) → GLn(OL).
Put
Ξ := {x | g ·1 x = g ·2 x} ⊂ O⊕n
L .
Define
w(ρ) := codim (kn
)ρ(IK )
−
1
G
· length
O⊕n
L
OL · Ξ
.
Here IK ⊂ GK is the inertia subgroup.
13 / 21
14. To GK
ρ
−→ G → GLn(K), we associate the Artin conductor
a(ρ) =
the tame part
t(ρ) +
the wild part (Swan cond.)
s(ρ) ∈ Z≥0.
Proposition (Wood-Y)
If G ⊂ GLn(OK ) is a :::::::::::
permutation representation, then
w(ρ) =
1
2
(t(ρ) − s(ρ)) .
14 / 21
15. The Hilbert scheme of points vs Bhargava’s mass formula
K: a local field with residue field k = Fq
G = Sn: the n-th symmetric group
Sn → GL2n(OK ): two copies of the standard representation
X := A2n/Sn = SnA2: the n-th symmetric product of the
affine plane (over OK )
Y := Hilbn(A2): the Hilbert scheme of n points (over OK )
Y
f
−→ X: the Hilbert-Chow morphism, known to be a crepant
resolution (Beauville, Kumar-Thomsen, Brion-Kumar)
15 / 21
16. Theorem (Wood-Y)
In this setting,
(f −1
(0)(Fq)) =
n−1
i=0
P(n, n − i)qi
=
1
n!
ρ∈Homcont (GK ,Sn)
qw(ρ)
.
Here P(n, j) := {partitions of n into exactly j parts}.
Bhargava’s mass formula
n−1
i=0
P(n, n − i)q−i
=
L/K: etale
[L:K]=n
1
Aut(L/K)
q−vK (disc(L/K))
Kedlaya
=
1
n!
ρ∈Homcont (GK ,Sn)
q−a(ρ)
.
16 / 21
17. Known cases
1 2 3 4
tame wild
B, D-L, Y, W-Y W-Y Y W-Y
group any Z/3Z ⊂ GL3 Z/pZ Sn ⊂ GL2n
k or OK k (char G) OK (char k= 3) k (char p) any
Conj 1 ! ! ! !
Conj 1’ ! !
Conj 2 ! !
17 / 21
18. Possible applications
(f −1
(0)(k)) =
1
G
ρ∈Homcont (Gk((t)),G)
qw(ρ)
Mst(X)0 =
ˆ
MK
Lw
Can compute the LHS’s (singularities) by computing the
RHS’s (arithmetics), and vice versa.
In low (resp. high) dimensions, the LHS’s (resp. RHS’s) seems
likely easier.
∃ a log resolution of X = An/G
⇒ rationality and duality of the LHS’s
⇔ rationality and duality of the RHS’s!!! (hidden structures
on the set/space of G-extensions of a local field)
18 / 21
19. Problem
Compute the RHS’s using the number theory and check whether
these properties holds.
If the properties do not hold, then a log resolution of X.
20. Future problems
Non-linear actions on possibly singular spaces (work in
progress)
Global fields
Hilbn
(A2
Z/Z)
??
←→ {L/Q | [L : Q] = n}
curve counting on wild orbifolds
Explicit (crepant) resolution of wild quotients in low
dimensions
⇒ many new mass formulas
Explicit computation of 1
G qw(ρ) and check the rationality
or duality.
Prove these properties in terms of the number theory.
20 / 21
21. One more problem
Problem
Does Batyrev’s theorem holds also in the wild case? Namely, if
K is a complete discrete valuation field with perfect residue
field k
G ⊂ GLn(OK ): a small finite subgroup
Y
f
−→ X := An
OK
/G: a crepant resolution,
then do we have the following equality?
e(Y ⊗OK
k) = {conj. classes in G}
Remark
This holds in a few cases we could compute. However, for now, I
do not see any reason that this holds except the tame case.
21 / 21