Source author record

Miguel Ballesteros

Miguel Ballesteros appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

29works
11topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

29 published item(s)

preprint2026arXiv

GSM-SEM: Benchmark and Framework for Generating Semantically Variant Augmentations

Benchmarks like GSM8K are popular measures of mathematical reasoning, but leaderboard gains can overstate true capability due to memorization of fixed test sets. Most robustness variants apply surface-level perturbations (paraphrases, renamings, number swaps, distractors) that largely preserve the underlying facts, and static releases can themselves become memorization targets over time. We introduce GSM-SEM, a reusable and stochastic framework for generating semantically diverse benchmark variants with substantially higher semantic variance than prior approaches. GSM-SEM perturbs problem statements by modifying entities, attributes, and/or relationships, frequently altering underlying facts and requiring models to recompute solutions under new conditions, while constraining generation to preserve the original calculations/answer and approximate problem difficulty. GSM-SEM generates fresh variants on each run without requiring re-annotation, reducing reliance on static public benchmarks for evaluation and thereby lowering the bias of memorization. We apply GSM-SEM on GSM8K and two existing variation suites (GSM-Symbolic and GSM-Plus), producing GSM8K-SEM, GSM-Symbolic-SEM, and GSM-Plus-SEM. Evaluating 14 SOTA LLMs, we observe consistent performance drops with larger decline when semantic perturbations are coupled with symbolic/plus variations (average drop rate 28% in maximum strictness configuration of GSM-SEM). We publicly release the three SEM variants as fully human-validated datasets. Finally, to demonstrate applicability beyond GSM-style math problems, we apply GSM-SEM to additional benchmarks including BigBenchHard, LogicBench, and NLR-BIRD.

preprint2022arXiv

Band edge limit of the scattering matrix for quasi-one-dimensional discrete Schrödinger operators

This paper is about the scattering theory for one-dimensional matrix Schrödinger operators with a matrix potential having a finite first moment. The transmission coefficients are analytically continued and extended to the band edges. An explicit expression is given for these extensions. The limits of the reflection coefficients at the band edges is also calculated.

preprint2022arXiv

Exploring the Role of Task Transferability in Large-Scale Multi-Task Learning

Recent work has found that multi-task training with a large number of diverse tasks can uniformly improve downstream performance on unseen target tasks. In contrast, literature on task transferability has established that the choice of intermediate tasks can heavily affect downstream task performance. In this work, we aim to disentangle the effect of scale and relatedness of tasks in multi-task representation learning. We find that, on average, increasing the scale of multi-task learning, in terms of the number of tasks, indeed results in better learned representations than smaller multi-task setups. However, if the target tasks are known ahead of time, then training on a smaller set of related tasks is competitive to the large-scale multi-task training at a reduced computational cost.

preprint2022arXiv

Label Semantics for Few Shot Named Entity Recognition

We study the problem of few shot learning for named entity recognition. Specifically, we leverage the semantic information in the names of the labels as a way of giving the model additional signal and enriched priors. We propose a neural architecture that consists of two BERT encoders, one to encode the document and its tokens and another one to encode each of the labels in natural language format. Our model learns to match the representations of named entities computed by the first encoder with label representations computed by the second encoder. The label semantics signal is shown to support improved state-of-the-art results in multiple few shot NER benchmarks and on-par performance in standard benchmarks. Our model is especially effective in low resource settings.

preprint2021arXiv

Analyticity properties of the scattering matrix for matrix Schrödinger operators on the discrete line

Explicit formulas for the analytic extensions of the scattering matrix and the time delay of a quasi-one-dimensional discrete Schrödinger operator with a potential of finite support are derived. This includes a careful analysis of the band edge singularities and allows to prove a Levinson-type theorem. The main algebraic tool are the plane wave transfer matrices.

preprint2021arXiv

Event-Driven News Stream Clustering using Entity-Aware Contextual Embeddings

We propose a method for online news stream clustering that is a variant of the non-parametric streaming K-means algorithm. Our model uses a combination of sparse and dense document representations, aggregates document-cluster similarity along these multiple representations and makes the clustering decision using a neural classifier. The weighted document-cluster similarity model is learned using a novel adaptation of the triplet loss into a linear classification objective. We show that the use of a suitable fine-tuning objective and external knowledge in pre-trained transformer models yields significant improvements in the effectiveness of contextual embeddings for clustering. Our model achieves a new state-of-the-art on a standard stream clustering dataset of English documents.

preprint2021arXiv

On the Evolution of Syntactic Information Encoded by BERT's Contextualized Representations

The adaptation of pretrained language models to solve supervised tasks has become a baseline in NLP, and many recent works have focused on studying how linguistic information is encoded in the pretrained sentence representations. Among other information, it has been shown that entire syntax trees are implicitly embedded in the geometry of such models. As these models are often fine-tuned, it becomes increasingly important to understand how the encoded knowledge evolves along the fine-tuning. In this paper, we analyze the evolution of the embedded syntax trees along the fine-tuning process of BERT for six different tasks, covering all levels of the linguistic structure. Experimental results show that the encoded syntactic information is forgotten (PoS tagging), reinforced (dependency and constituency parsing) or preserved (semantics-related tasks) in different ways along the fine-tuning process depending on the task.

preprint2020arXiv

One-Boson Scattering Processes in the Massless Spin-Boson Model -- A Non-Perturbative Formula

In scattering experiments, physicists observe so-called resonances as peaks at certain energy values in the measured scattering cross sections per solid angle. These peaks are usually associate with certain scattering processes, e.g., emission, absorption, or excitation of certain particles and systems. On the other hand, mathematicians define resonances as poles of an analytic continuation of the resolvent operator through complex dilations. A major challenge is to relate these scattering and resonance theoretical notions, e.g., to prove that the poles of the resolvent operator induce the above mentioned peaks in the scattering matrix. In the case of quantum mechanics, this problem was addressed in numerous works that culminated in Simon's seminal paper [33] in which a general solution was presented for a large class of pair potentials. However, in quantum field theory the analogous problem has been open for several decades despite the fact that scattering and resonance theories have been well-developed for many models. In certain regimes these models describe very fundamental phenomena, such as emission and absorption of photons by atoms, from which quantum mechanics originated. In this work we present a first non-perturbative formula that relates the scattering matrix to the resolvent operator in the massless Spin-Boson model. This result can be seen as a major progress compared to our previous works [13] and [12] in which we only managed to derive a perturbative formula.

preprint2020arXiv

Severing the Edge Between Before and After: Neural Architectures for Temporal Ordering of Events

In this paper, we propose a neural architecture and a set of training methods for ordering events by predicting temporal relations. Our proposed models receive a pair of events within a span of text as input and they identify temporal relations (Before, After, Equal, Vague) between them. Given that a key challenge with this task is the scarcity of annotated data, our models rely on either pretrained representations (i.e. RoBERTa, BERT or ELMo), transfer and multi-task learning (by leveraging complementary datasets), and self-training techniques. Experiments on the MATRES dataset of English documents establish a new state-of-the-art on this task.

preprint2020arXiv

Transition-Based Dependency Parsing using Perceptron Learner

Syntactic parsing using dependency structures has become a standard technique in natural language processing with many different parsing models, in particular data-driven models that can be trained on syntactically annotated corpora. In this paper, we tackle transition-based dependency parsing using a Perceptron Learner. Our proposed model, which adds more relevant features to the Perceptron Learner, outperforms a baseline arc-standard parser. We beat the UAS of the MALT and LSTM parsers. We also give possible ways to address parsing of non-projective trees.

preprint2016arXiv

Distilling an Ensemble of Greedy Dependency Parsers into One MST Parser

We introduce two first-order graph-based dependency parsers achieving a new state of the art. The first is a consensus parser built from an ensemble of independently trained greedy LSTM transition-based parsers with different random initializations. We cast this approach as minimum Bayes risk decoding (under the Hamming cost) and argue that weaker consensus within the ensemble is a useful signal of difficulty or ambiguity. The second parser is a "distillation" of the ensemble into a single model. We train the distillation parser using a structured hinge loss objective with a novel cost that incorporates ensemble uncertainty estimates for each possible attachment, thereby avoiding the intractable cross-entropy computations required by applying standard distillation objectives to problems with structured outputs. The first-order distillation parser matches or surpasses the state of the art on English, Chinese, and German.

preprint2016arXiv

Existence of Ground State Eigenvalues for the Spin-Boson Model with Critical Infrared Divergence and Multiscale Analysis

A two-level atom coupled to the radiation field is studied. First principles in physics suggest that the coupling function, representing the interaction between the atom and the radiation field, behaves like $\vert k \vert^{- 1/2}$, as the photon momentum k tends to zero. Previous results on non-existence of ground state eigenvalues suggest that in the most general case binding does not occur in the spin-boson model, i.e., the minimal energy of the atom-photon system is not an eigenvalue of the energy operator. Hasler and Herbst have shown [12], however, that under the additional hypothesis that the coupling function be off-diagonal -which is customary to assume-binding does indeed occur. In this paper an alternative proof of binding in case of off-diagonal coupling is given, i.e., it is proven that, if the coupling function is off-diagonal, the ground state energy of the spin-boson model is an eigenvalue of the Hamiltonian. We develop a multiscale method that can be applied in the situation we study, identifying a new key symmetry operator which we use to demonstrate that the most singular terms appearing in the multiscale analysis vanish.

preprint2016arXiv

High-Momenta Estimates for the Klein-Gordon Equation: Long-Range Magnetic Potentials and Time-Dependent Inverse Scattering

The study of obstacle scattering for the Klein-Gordon equation in the presence of long-range magnetic potentials is addressed. Previous results of the authors are extended to the long-range case and the results the authors previously proved for high-momenta long-range scattering for the Schrödinger equation are brought to the relativistic scenario. It is shown that there are important differences between relativistic and non-relativistic scattering concerning long-range. In particular, it is proved that the electric potential can be recovered without assuming the knowledge of the long-range part of the magnetic potential, which has to be supposed in the non-relativistic case. The electric potential and the magnetic field are recovered from the high momenta limit of the scattering operator, as well as fluxes modulo $2 π$ around handles of the obstacle. Moreover, it is proved that, for every $\hat{\mathbf v} \in \mathbb{S}^2$, $ A_\infty(\hat{\mathbf v}) + A_\infty(-\hat{\mathbf v})$ can be reconstructed, where $A_\infty$ is the long-range part of the magnetic potential. A a simple formula for the high momenta limit of the scattering operator is given, in terms of magnetic fluxes over handles of the obstacle and long-range magnetic fluxes at infinity, that are introduced in this paper. The appearance of these long-range magnetic fluxes is a new effect in scattering theory.

preprint2016arXiv

Many Languages, One Parser

We train one multilingual model for dependency parsing and use it to parse sentences in several languages. The parsing model uses (i) multilingual word clusters and embeddings; (ii) token-level language information; and (iii) language-specific features (fine-grained POS tags). This input representation enables the parser not only to parse effectively in multiple languages, but also to generalize across languages based on linguistic universals and typological similarities, making it more effective to learn from limited annotations. Our parser's performance compares favorably to strong baselines in a range of data scenarios, including when the target language has a large treebank, a small treebank, or no treebank for training.

preprint2016arXiv

Neural Architectures for Named Entity Recognition

State-of-the-art named entity recognition systems rely heavily on hand-crafted features and domain-specific knowledge in order to learn effectively from the small, supervised training corpora that are available. In this paper, we introduce two new neural architectures---one based on bidirectional LSTMs and conditional random fields, and the other that constructs and labels segments using a transition-based approach inspired by shift-reduce parsers. Our models rely on two sources of information about words: character-based word representations learned from the supervised corpus and unsupervised word representations learned from unannotated corpora. Our models obtain state-of-the-art performance in NER in four languages without resorting to any language-specific knowledge or resources such as gazetteers.

preprint2016arXiv

Recurrent Neural Network Grammars

We introduce recurrent neural network grammars, probabilistic models of sentences with explicit phrase structure. We explain efficient inference procedures that allow application to both parsing and language modeling. Experiments show that they provide better parsing in English than any single previously published supervised generative model and better language modeling than state-of-the-art sequential RNNs in English and Chinese.

preprint2016arXiv

Static and Dynamic Feature Selection in Morphosyntactic Analyzers

We study the use of greedy feature selection methods for morphosyntactic tagging under a number of different conditions. We compare a static ordering of features to a dynamic ordering based on mutual information statistics, and we apply the techniques to standalone taggers as well as joint systems for tagging and parsing. Experiments on five languages show that feature selection can result in more compact models as well as higher accuracy under all conditions, but also that a dynamic ordering works better than a static ordering and that joint systems benefit more than standalone taggers. We also show that the same techniques can be used to select which morphosyntactic categories to predict in order to maximize syntactic accuracy in a joint system. Our final results represent a substantial improvement of the state of the art for several languages, while at the same time reducing both the number of features and the running time by up to 80% in some cases.

preprint2016arXiv

Training with Exploration Improves a Greedy Stack-LSTM Parser

We adapt the greedy Stack-LSTM dependency parser of Dyer et al. (2015) to support a training-with-exploration procedure using dynamic oracles(Goldberg and Nivre, 2013) instead of cross-entropy minimization. This form of training, which accounts for model predictions at training time rather than assuming an error-free action history, improves parsing accuracies for both English and Chinese, obtaining very strong results for both languages. We discuss some modifications needed in order to get training with exploration to work well for a probabilistic neural-network.

preprint2015arXiv

Aharonov-Bohm Effect and High-Momenta Inverse Scattering for the Klein-Gordon Equation

We analyze spin-0 relativistic scattering of charged particles propagating in the exterior, $Λ\subset \mathbb{R}^3$, of a compact obstacle $K \subset \mathbb{R}^3$. The connected components of the obstacle are handlebodies. The particles interact with an electro-magnetic field in $Λ$ and an inaccessible magnetic field localized in the interior of the obstacle (through the Aharonov-Bohm effect). We obtain high-momenta estimates, with error bounds, for the scattering operator that we use to recover physical information: We give a reconstruction method for the electric potential and the exterior magnetic field and prove that, if the electric potential vanishes, circulations of the magnetic potential around handles (or equivalently, by Stokes' theorem, magnetic fluxes over transverse sections of handles) of the obstacle can be recovered, modulo $2 π$. We additionally give a simple formula for the high-momenta limit of the scattering operator in terms of certain magnetic fluxes, in the absence of electric potential. If the electric potential does not vanish, the magnetic fluxes on the handles above referred can be only recovered modulo $π$ and the simple expression of the high-momenta limit of the scattering operator does not hold true.

preprint2015arXiv

Improved Transition-Based Parsing by Modeling Characters instead of Words with LSTMs

We present extensions to a continuous-state dependency parsing method that makes it applicable to morphologically rich languages. Starting with a high-performance transition-based parser that uses long short-term memory (LSTM) recurrent neural networks to learn representations of the parser state, we replace lookup-based word representations with representations constructed from the orthographic representations of the words, also using LSTMs. This allows statistical sharing across word forms that are similar on the surface. Experiments for morphologically rich languages show that the parsing model benefits from incorporating the character-based encodings of words.

preprint2015arXiv

Indirect retrieval of information and the emergence of facts in quantum mechanics

Long sequences of successive direct (projective) measurements or observations of a few "uninteresting" physical quantities of a quantum system may reveal indirect, but precise and unambiguous information on the values of some very "interesting" observables of the system. In this paper, the mathematics underlying this claim is developed; i.e., we attempt to contribute to a mathematical theory of indirect and, in particular, non-demolition measurements in quantum mechanics. Our attempt leads us to make novel uses of classical notions and results of probability theory, such as the "algebra of functions measurable at infinity", the Central Limit Theorem, results concerning relative entropy and its role in the theory of large deviations, etc.

preprint2015arXiv

Quantum Electrodynamics of Atomic Resonances

A simple model of an atom interacting with the quantized electromagnetic field is studied. The atom has a finite mass $m$, finitely many excited states and an electric dipole moment, $\vec{d}_0 = -λ_{0} \vec{d}$, where $\| d^{i}\| = 1,$ $ i=1,2,3,$ and $λ_0$ is proportional to the elementary electric charge. The interaction of the atom with the radiation field is described with the help of the Ritz Hamiltonian, $-\vec{d}_0\cdot \vec{E}$, where $\vec{E}$ is the electric field, cut off at large frequencies. A mathematical study of the Lamb shift, the decay channels and the life times of the excited states of the atom is presented. It is rigorously proven that these quantities are analytic functions of the momentum $\vec{p}$ of the atom and of the coupling constant $λ_0$, provided $|\vec{p}| < mc$ and $| \Im\vec{p} |$ and $| λ_{0} |$ are sufficiently small. The proof relies on a somewhat novel inductive construction involving a sequence of `smooth Feshbach-Schur maps' applied to a complex dilatation of the original Hamiltonian, which yields an algorithm for the calculation of resonance energies that converges super-exponentially fast.

preprint2015arXiv

Transition-Based Dependency Parsing with Stack Long Short-Term Memory

We propose a technique for learning representations of parser states in transition-based dependency parsers. Our primary innovation is a new control structure for sequence-to-sequence neural networks---the stack LSTM. Like the conventional stack data structures used in transition-based parsing, elements can be pushed to or popped from the top of the stack in constant time, but, in addition, an LSTM maintains a continuous space embedding of the stack contents. This lets us formulate an efficient parsing model that captures three facets of a parser's state: (i) unbounded look-ahead into the buffer of incoming words, (ii) the complete history of actions taken by the parser, and (iii) the complete contents of the stack of partially built tree fragments, including their internal structures. Standard backpropagation techniques are used for training and yield state-of-the-art parsing performance.

preprint2014arXiv

High-Velocity Estimates for Schrödinger Operators in Two Dimensions: Long-Range Magnetic Potentials and Time-Dependent Inverse Scattering

We introduce a general class of long-range magnetic potentials and derive high velocity limits for the scattering operators in quantum mechanics, in the case of two dimensions. We analyze the high velocity limits in the presence of an obstacle and we uniquely reconstruct from them the electric potential and the magnetic field outside the obstacle. We also reconstruct the inaccessible magnetic fluxes produced by fields inside the obstacle modulo $2 π$. For every magnetic potential $A$ in our class we prove that its behavior at infinity ($A_\infty(\hat{\mathbf v}), \hat{\mathbf v} \in \mathbb{S}^1$) can be characterized in a natural way. Under very general assumptions we prove that $A_\infty(\hat{\mathbf v}) + A_\infty(- \hat{\mathbf v})$ can be uniquely reconstructed for every $\hat{\mathbf v} \in \mathbb{S}^1$. We characterize properties of the support of the magnetic field outside the obstacle that permit us to uniquely reconstruct $A_\infty(\hat{\mathbf v})$ either for all $ \hat{\mathbf v} \in \mathbb{S}^1$ or for $\hat{\mathbf v}$ in a subset of $\mathbb{S}^1$. We also give a wide class of magnetic fields outside the obstacle allowing us to uniquely reconstruct the total magnetic flux (and $A_\infty(\hat{\mathbf v})$ for all $ \hat{\mathbf v} \in \mathbb{S}^1$). This is relevant because, as it is well-known, in general the scattering operator (even if is known for all velocities or energies) does not define uniquely the total magnetic flux (and $A_\infty(\hat{\mathbf v})$ ). We analyze additionally injectivity (i.e., uniqueness without giving a method for reconstruction) of the high velocity limits of the scattering operator with respect to $A_\infty(\hat{\mathbf v})$. Assuming that the magnetic field outside the obstacle is not identically zero, we provide a class of magnetic potentials for which injectivity is valid.

preprint2013arXiv

Continuous Renormalization Group Analysis of Spectral Problems in Quantum Field Theory

The isospectral renormalization group is a powerful method to analyze the spectrum of operators in quantum field theory. It was introduced in 1995 [see \cite{BachFrohlichSigal1995}, \cite{BachFrohlichSigal1998}] and since then it has been used to prove several results for non-relativistic quantum electrodynamics. After the introduction of the method there have been many works in which extensions, simplifications or clarifications are presented (see \cite{BachChenFrohlichSigal2003}, \cite{GriesemerHasler2008}, \cite{FrohlichGriesemerSigal2009}). In this paper we present a new approach in which we construct a flow of operators parametrized by a continuous variable in the positive real axis. While this is in contrast to the discrete iteration used before, this is more in spirit of the original formulation of the renormalization group introduced in theoretical physics in 1974 \cite{KogutWilson1974}. The renormalization flow that we construct can be expressed in a simple way: it can be viewed as a single application of the Feshbach-Schur map with a clever selection of the spectral parameter. Another advantage of the method is that there exists a flow function for which the renormalization group that we present is the orbit under this flow of an initial Hamiltonian. This opens the possibility to study the problem using different techniques coming from the theory of evolution equations.

preprint2013arXiv

Existence and Construction of Resonances for Atoms Coupled to the Quantized Radiation Field

For a nonrelativistic atom, which is minimally coupled to the quantized radiation field, resonances emerging from excited atomic eigenstates are constructed by an iteration scheme inspired by \cite{Pizzo2003} and \cite{BachFrohlichPizzo2006}. This scheme successively removes an infrared cut off in momentum space and yields a convergent algorithm enabling us to calculate the resonance eigenvalues and eigenstates, to arbitrary order in the feinstructure constant $α\sim 1/137$, and is thus an alternative method of proof of a similar result obtained in \cite{Sigal2010}.

preprint2010arXiv

Aharonov-Bohm Effect and High-Velocity Estimates of Solutions to the Schrödinger Equation

The Aharonov-Bohm effect is a fundamental and controversial issue in physics. At stake are what are the fundamental electromagnetic quantities in quantum physics, if magnetic fields can act at a distance on charged particles and if the magnetic potentials have a real physical significance. From the experimental side the issues were settled by the remarkable experiments of Tonomura et al. in 1982 and 1986 with toroidal magnets that gave a strong experimental evidence of the physical existence of the Aharonov-Bohm effect, and by the recent experiment of Caprez et al. in 2007 that shows that the results of these experiments can not be explained by a force. The Aharonov-Bohm Ansatz of 1959 predicts the results of the experiments of Tonomura et al. and of Caprez et al. In 2009 we gave the first rigorous proof that the Aharonov-Bohm Ansatz is a good approximation to the exact solution for toroidal magnets under the conditions of the experiments of Tonomura et al.. In this paper we prove that our results do not depend on the particular geometry of the magnets and on the velocities of the incoming electrons used on the experiments, and on the gaussian shape of the wave packets used to obtain our quantitative error bound. We consider a general class of magnets that are a finite union of handle bodies. We formulate the Aharonov-bohm Ansatz that is appropriate to this general case and we prove that the exact solution to the Schroedinger equation is given by the Aharonov-Bohm Ansatz up to an error bound in norm that is uniform in time and that decays as a constant divided by $v^ρ, 0 < ρ<1$, with $v$ the velocity. The results of Tonomura et al., of Caprez et al., our previous results and the results of this paper give a firm experimental and theoretical basis to the existence of the Aharonov-Bohm effect and to its quantum nature.

preprint2010arXiv

The Aharonov-Bohm Effect and Tonomura et al. Experiments. Rigorous Results

We study the Aharonov-Bohm effect under the conditions of the Tonomura et al. experiments, that gave a strong evidence of the physical existence of the Aharonov-Bohm effect, and we give the first rigorous proof that the classical Ansatz of Aharonov and Bohm is a good approximation to the exact solution of the Schroedinger equation. We provide a rigorous, quantitative, error bound for the difference in norm between the exact solution and the approximate solution given by the Aharonov-Bohm Ansatz. Our error bound is uniform in time. Using the experimental data, we rigorously prove that the results of the Tonomura et al. experiments, that were predicted by Aharonov and Bohm, actually follow from quantum mechanics. Furthermore, our results show that it would be quite interesting to perform experiments for intermediate size electron wave packets (smaller than the ones used in the Tonomura et al. experiments, that were much larger than the magnet) whose variance satisfies appropriate lower and upper bounds that we provide. One could as well take a larger magnet. In this case, the interaction of the electron wave packet with the magnet is negligible -the probability that the electron wave packet interacts with the magnet is smaller than $10^{-199}$- and, moreover, quantum mechanics predicts the results observed by Tonomura et al. with an error bound smaller than $10^{-99}$, in norm. Our error bound has a physical interpretation. For small variances it is due to Heisenberg's uncertainty principle and for large variances to the interaction with the magnet.

preprint2007arXiv

High-Velocity Estimates for the Scattering Operator and Aharonov-Bohm Effect in Three Dimensions

We obtain high-velocity estimates with error bounds for the scattering operator of the Schrödinger equation in three dimensions with electromagnetic potentials in the exterior of bounded obstacles that are handlebodies. A particular case is a finite number of tori. We prove our results with time-dependent methods. We consider high-velocity estimates where the direction of the velocity of the incoming electrons is kept fixed as its absolute value goes to infinity. In the case of one torus our results give a rigorous proof that quantum mechanics predicts the interference patterns observed in the fundamental experiments of Tonomura et al. that gave a conclusive evidence of the existence of the Aharonov-Bohm effect using a toroidal magnet. We give a method for the reconstruction of the flux of the magnetic field over a cross-section of the torus modulo $2π$. Equivalently, we determine modulo $2π$ the difference in phase for two electrons that travel to infinity, when one goes inside the hole and the other outside it. For this purpose we only need the high-velocity limit of the scattering operator for one direction of the velocity of the incoming electrons. When there are several tori -or more generally handlebodies- the information that we obtain in the fluxes, and on the difference of phases, depends on the relative position of the tori and on the direction of the velocities when we take the high-velocity limit of the incoming electrons. For some locations of the tori we can determine all the fluxes modulo 2$π$ by taking the high-velocity limit in only one direction. We also give a method for the unique reconstruction of the electric potential and the magnetic field outside the handlebodies from the high-velocity limit of the scattering operator.