Related papers: Act globally, compute locally: group actions, fixe…
We consider a Hamiltonian action of n-dimensional torus, T^n, on a compact symplectic manifold (M,\omega) with d isolated fixed points. For every fixed point p there exists (though not unique) a class a_p in H^*_{T}(M; Q) such that the…
We present a generic construction of finite realisations of amalgamation patterns. An amalgamation pattern is specified by a finite collection of finite template structures together with a collection of partial isomorphisms between them. A…
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
Equivariant cohomology, a captivating fusion of symmetry and abstract mathematics, illuminates the profound role of group actions in shaping geometric structures. At its core lies the Atiyah-Bott Localization Theorem, a mathematical jewel…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
We generalize Exel's notion of partial group action to monoids. For partial monoid actions that can be defined by means of suitably well-behaved systems of generators and relations, we employ classical rewriting theory in order to describe…
A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…
We propose a new globalization strategy that can be used in unconstrained optimization algorithms to support rapid convergence from remote starting points. Our approach is based on using multiple points at each iteration to build a…
(Completely regular) locales generalize (Tychonoff) spaces; indeed, the passage from a locale to its spatial sublocale is a well understood coreflection. But a locale also possesses an equally important pointless sublocale, and with…
The topological vertex is a universal series which can be regarded as an object in combinatorics, representation theory, geometry, or physics. It encodes the combinatorics of 3D partitions, the action of vertex operators on Fock space, the…
Topological holography is a holographic principle that describes the generalized global symmetry of a local quantum system in terms of a topological order in one higher dimension. This framework separates the topological data from the local…
Unsupervised representation learning methods are widely used for gaining insight into high-dimensional, unstructured, or structured data. In some cases, users may have prior topological knowledge about the data, such as a known cluster…
Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic…
In this expository article, we explain how to use localization to compute Gromov-Witten invariants of smooth toric varieties and orbifold Gromov-Witten invariants of smooth toric Deligne-Mumford stacks.
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
In his recent research M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can…
Within a global physical theory, a notion of locality allows us to find and justify information-processing primitives, like non-signalling between distant agents. Here we propose exploring the opposite direction: to take agents as the basic…
An original graph clustering approach to efficient localization of error covariances is proposed within an ensemble-variational data assimilation framework. Here the localization term is very generic and refers to the idea of breaking up a…
Locales have been studied as "topologies without points", mainly by tools of category theory. While traditional topology presents a space as a set of points with specified neighborhoods, localic topology presents a space as a lattice of…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…