English
Related papers

Related papers: Characteristic classes as obstructions to local ho…

200 papers

We extend the notion of connection in order to be able to study singular geometric structures, namely, we consider a notion of connection on a Lie algebroid which is a natural extension of the usual concept of connection. Using connections,…

Differential Geometry · Mathematics 2007-05-23 Rui Loja Fernandes

This is a lecture note prepared for the SFT 9 workshop in Augsburg, Germany. The text describes a polyfold approach to the construction of symplectic field theory and focuses on the perturbation and transversality theory.

Symplectic Geometry · Mathematics 2018-08-23 Joel W. Fish , Helmut Hofer

We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…

Logic · Mathematics 2025-07-11 Kai Ino , Omar Leon Sanchez

We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…

Group Theory · Mathematics 2025-11-20 Peter A. Brooksbank , Heiko Dietrich , Joshua Maglione , E. A. O'Brien , James B. Wilson

Large pre-trained language models have shown remarkable performance over the past few years. These models, however, sometimes learn superficial features from the dataset and cannot generalize to the distributions that are dissimilar to the…

Computation and Language · Computer Science 2022-10-31 Jieyu Zhao , Xuezhi Wang , Yao Qin , Jilin Chen , Kai-Wei Chang

Empirical networks are often globally sparse, with a small average number of connections per node, when compared to the total size of the network. However, this sparsity tends not to be homogeneous, and networks can also be locally dense,…

Physics and Society · Physics 2020-07-20 Tiago P. Peixoto

We study the problem of recovering the latent ground truth labeling of a structured instance with categorical random variables in the presence of noisy observations. We present a new approximate algorithm for graphs with categorical…

Machine Learning · Computer Science 2019-07-09 Alireza Heidari , Ihab F. Ilyas , Theodoros Rekatsinas

These notes combine material from short lecture courses given in Paris, France, in July 2001 and in Srni, the Czech Republic, in January 2003. They discuss groups of symplectomorphisms of closed symplectic manifolds (M,\om) from various…

Symplectic Geometry · Mathematics 2007-05-23 Dusa McDuff

Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling scheme (PLS) is a distributed verification system dedicated to evaluating if a given configured graph satisfies a certain property. It involves a centralized prover,…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-25 Yuval Emek , Yuval Gil , Shay Kutten

This paper is an expanded version of two talks given by the author at the Summer School on the Interactions between Homotopy Theory and Algebra at the University of Chicago, July 26 to August 6, 2004. It describes a connection between model…

Algebraic Topology · Mathematics 2007-05-23 Mark Hovey

These lecture notes are based on lectures given in 2019 Saint-Flour Probability School.

Probability · Mathematics 2020-12-21 Elchanan Mossel

Contrastive learning is a significant paradigm in graph self-supervised learning. However, it requires negative samples to prevent model collapse and learn discriminative representations. These negative samples inevitably lead to heavy…

Machine Learning · Computer Science 2024-08-12 Yunhui Liu , Huaisong Zhang , Tieke He , Tao Zheng , Jianhua Zhao

Exposure bias describes the phenomenon that a language model trained under the teacher forcing schema may perform poorly at the inference stage when its predictions are conditioned on its previous predictions unseen from the training…

Computation and Language · Computer Science 2020-04-02 Yifan Xu , Kening Zhang , Haoyu Dong , Yuezhou Sun , Wenlong Zhao , Zhuowen Tu

We will cover the basics of several complex variables in 4 lectures: Basic properties of holomorphic functions in several variables, the notion of pseudoconvexity, CR functions and CR geometry, and the $\bar\partial$-problem. The main…

High Energy Physics - Theory · Physics 2024-11-05 Sean N. Curry , Jiří Lebl , Mathieu Giroux , Holmfridur S. Hannesdottir , Sebastian Mizera , Celina Pasiecznik

We introduce a notion of secondary characteristic classes of Lie algebra extensions. As a spin-off of our construction we obtain a new proof of Lecomte's generalization of the Chern-Weil homomorphism.

Differential Geometry · Mathematics 2025-12-24 Stefan Wagner

Deep learning models are known to often learn features that spuriously correlate with the class label during training but are irrelevant to the prediction task. Existing methods typically address this issue by annotating potential spurious…

Computer Vision and Pattern Recognition · Computer Science 2025-12-30 Weiwei Li , Junzhuo Liu , Yuanyuan Ren , Yuchen Zheng , Yahao Liu , Wen Li

Character-level patterns have been widely used as features in English Named Entity Recognition (NER) systems. However, to date there has been no direct investigation of the inherent differences between name and non-name tokens in text, nor…

Computation and Language · Computer Science 2018-09-21 Xiaodong Yu , Stephen Mayhew , Mark Sammons , Dan Roth

We survey some recent developments at the interface of algebraic geometry, surface topology, and the theory of ordinary differential equations. Motivated by "non-abelian" analogues of standard conjectures on the cohomology of algebraic…

Algebraic Geometry · Mathematics 2024-09-05 Daniel Litt

This article is the writing notes of a talk on Lie Antialgebras given by the second author at the conference "3Quantum: Algebra Geometry Information" that held in Tallinn in July 2012. The aim of this note is to give a brief survey of the…

Mathematical Physics · Physics 2013-10-15 Séverine Leidwanger , Sophie Morier-Genoud

We study verification (decision) problems for graph properties in distributed networks under the locally checkable labeling framework, where nodes use labels (proofs) and local neighborhoods to decide acceptance or rejection. Our focus is…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-24 Paweł Garncarek , Tomasz Jurdzinski , Dariusz Kowalski , Subhajit Pramanick