相关论文: Computing characteristic classes of projective sch…

The classical theory of the cross-ratio is a beautiful case study of the moduli of ordered points of the projective line and of invariants of the action of $PGL_2$. We generalize the theory of the cross-ratio to the setting of $S$-valued…

We calculate the Euler characteristics of the local systems S^k(V) \otimes S^l\Wedge^2(V) on the moduli space M_2 of curves of genus 2, where V is the rank 4 local system R^1\pi_*C.

This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing their nucleolus was not previously known. We show that when the…

In a previous paper it was shown that a machine learning regression problem can be solved within the framework of random function theory, with the optimal kernel analytically derived from symmetry and indifference principles and coinciding…

We construct characteristic classes for singular algebraic varieties in motivic Borel-Moore homology, extending the motivic Euler class of the tangent bundle defined for smooth varieties. The two classes we define refine, in the setting of…

We compute the integral homology and cohomology groups of configuration spaces of two distinct points on a given real projective space. The explicit answer is related to the (known multiplicative structure in the) integral cohomology---with…

Given a stochastic differential equation (SDE) in $\mathbb{R}^n$ whose solution is constrained to lie in some manifold $M \subset \mathbb{R}^n$, we propose a class of numerical schemes for the SDE whose iterates remain close to $M$ to high…

This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…

We study instancewise feature importance scoring as a method for model interpretation. Any such method yields, for each predicted instance, a vector of importance scores associated with the feature vector. Methods based on the Shapley score…

We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…

We present in this paper a framework which leverages the underlying topology of a data set, in order to produce appropriate coordinate representations. In particular, we show how to construct maps to real and complex projective spaces,…

An index theory for projective families of elliptic pseudodifferential operators is developed when the twisting, i.e. Dixmier-Douady, class is decomposable. One of the features of this special case is that the corresponding Azumaya bundle…

In this paper we study paramertized motion planning algorithms which provide universal and flexible solutions to diverse motion planning problems. Such algorithms are intended to function under a variety of external conditions which are…

We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and…

This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…

Let X be a projective scheme; let M and N be two coherent O_X-modules. Given an integer m, we present an algorithm for computing the global extension module Ext^m(X;M,N). In particular, this allows one to compute the sheaf cohomology…

This paper investigates two feature-scoring criteria that make use of estimated class probabilities: one method proposed by \citet{shen} and a complementary approach proposed below. We develop a theoretical framework to analyze each…

We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement…

A classical approach to investigate a closed projective scheme $W$ consists of considering a general hyperplane section of $W$, which inherits many properties of $W$. The inverse problem that consists in finding a scheme $W$ starting from a…

In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…