skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Lattice vertex algebras and Loop Grassmannians
For an integral symmetric matrix κ we construct a new “nonabelian homology localization” of the lattice vertex algebra Lκ on the corresponding loop Grassmannian space 𝒢κ. We attempt to motivate our construction by presenting related topics in the language of “interaction of particles over algebraic curves”.  more » « less
Award ID(s):
1904107
PAR ID:
10463236
Author(s) / Creator(s):
Date Published:
Journal Name:
Marktontwikkelingen Deel 4 Transport groothandel
Volume:
volume 28,
ISSN:
1567-3340
Page Range / eLocation ID:
1221–1243.
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, SSRN Electronic Journal)
    null (Ed.)
    In this work, we report on a comprehensive analysis of PKI resulting from Certificate Authorities’ (CAs) behavior using over 1300 instances. We found several cases where CAs designed business models that favored the issuance of digital certificates over the guidelines of the CA Forum, root management programs, and other PKI requirements. Examining PKI from the perspective of business practices, we identify a taxonomy of failures and identify systemic vulnerabilities in the governance and practices in PKI. Notorious cases include the “backdating” of digital certificates, the issuance of these for MITM attempts, the lack of verification of a requester’s identity, and the unscrupulous issuance of rogue certificates. We performed a detailed study of 379 of these 1300 incidents. Using this sample, we developed a taxonomy of the different types of incidents and their causes. For each incident, we determined if the incident was disclosed by the problematic CA. We also noted the Root CA and the year of the incident. We identify the failures in terms of business practices, geography, and outcomes from CAs. We analyzed the role of Root Program Owners (RPOs) and differentiated their policies. We identified serial and chronic offenders in the PKI trusted root programs. Some of these were distrusted by RPOs, while others remain being trusted despite failures. We also identified cases where the concentration of power of RPOs was arguably a contributing factor in the incident. We identify these cases where there is a risk of concentration of power and the resulting conflict of interests. Our research is the first comprehensive academic study addressing all verified reported incidents. We approach this not from a machine learning or statistical perspective but, rather, we identify each reported public incident with a focus on identifying patterns of individual lapses. Here we also have a specific focus on the role of CAs and RPOs. Building on this study, we identify the issues in incentive structures that are contributors to the problems. 
    more » « less
  2. ; ; ; ; (, Journal of Evolution Equations)
    Abstract We introduce the map of dynamics of quantum Bose gases into dynamics of quasifree states, which we call the “nonlinear quasifree approximation”. We use this map to derive the time-dependent Hartree–Fock–Bogoliubov (HFB) equations describing the dynamics of quantum fluctuations around a Bose–Einstein condensate. We prove global well-posedness of the HFB equations for pair potentials satisfying suitable regularity conditions, and we establish important conservation laws. We show that the space of solutions of the HFB equations has a symplectic structure reminiscent of a Hamiltonian system. This is then used to relate the HFB equations to the HFB eigenvalue equations discussed in the physics literature. We also construct Gibbs equilibrium states at positive temperature associated with the HFB equations, and we establish criteria for the appearance of Bose–Einstein condensation. 
    more » « less
  3. ; ; ; ; ; ; ; ; (, Astronomy & Astrophysics)
    Context.We report here on new results of the systematic monitoring of southern glitching pulsars at the Argentine Institute of Radioastronomy. In particular, we study in this work the new major glitch in the Vela pulsar (PSR J0835−4510) that occurred on 2024 April 29. Aims.We aim to thoroughly characterise the rotational behaviour of the Vela pulsar around its last major glitch and investigate the statistical properties of its individual pulses around the glitch. Methods.We characterise the rotational behaviour of the pulsar around the glitch through the pulsar timing technique. We measured the glitch parameters by fitting timing residuals to the data collected during the days surrounding the event. In addition, we study Vela individual pulses during the days of observation just before and after the glitch. We selected nine days of observations around the major glitch on 2024 April 29 and studied their statistical properties with the Self-Organizing Maps (SOM) technique. We used Variational AutoEncoder (VAE) reconstruction of the individual pulses to separate them clearly from the noise. Results.We obtain a precise timing solution for the glitch. We find two recovery terms of ∼3 days and ∼17 days. We find a correlation of high amplitude with narrower pulses while not finding notable qualitative systematic changes before and after the glitch. 
    more » « less
  4. ; ; (, Proceedings of Machine Learning Research)
    Consider jointly Gaussian random variables whose conditional independence structure is specified by a graphical model. If we observe realizations of the variables, we can compute the covariance matrix, and it is well known that the support of the inverse covariance matrix corresponds to the edges of the graphical model. Instead, suppose we only have noisy observations. If the noise at each node is independent, we can compute the sum of the covariance matrix and an unknown diagonal. The inverse of this sum is (in general) dense. We ask: can the original independence structure be recovered? We address this question for tree structured graphical models. We prove that this problem is unidentifiable, but show that this unidentifiability is limited to a small class of candidate trees. We further present additional constraints under which the problem is identifiable. Finally, we provide an O(n^3) algorithm to find this equivalence class of trees. 
    more » « less
  5. ; ; (, International Conference on Automated Deduction CADE-28)
    We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed binary–ternary representations of positive integers. Termination of this rewriting system is equivalent to the Collatz conjecture. To show the feasibility of our approach in proving mathematically interesting statements, we implement a minimal termination prover that uses the automated method of matrix/arctic interpretations and we perform experiments where we obtain proofs of nontrivial weakenings of the Collatz conjecture. Finally, we adapt our rewriting system to show that other open problems in mathematics can also be approached as termination problems for relatively small rewriting systems. Although we do not succeed in proving the Collatz conjecture, we believe that the ideas here represent an interesting new approach. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email