相关论文: SPM Bulletin 1

We propose a new class of determinantal point processes (DPPs) which can be manipulated for inference and parameter learning in potentially sublinear time in the number of items. This class, based on a specific low-rank factorization of the…

This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…

We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…

This paper is part of series on self-contained papers in which a large part, if not the full extent, of the asymptotic limit theory of summands of independent random variables is exposed. Each paper of the series may be taken as review…

We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…

Increasingly, researchers have suggested the benefits of temporal analysis to improve our understanding of the learning process. Sequential pattern mining (SPM), as a pattern recognition technique, has the potential to reveal the temporal…

This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

This is the first report on Working Paper WP-RFM-14-01. The potential and capability of sparse representations is well-known. However, their (multivariate variable) vectorial form, which is completely fine in many fields and disciplines,…

The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…

The purpose of this short paper is to identify the mathematical essence of the superiorization methodology. This methodology has been developed in recent years while attempting to solve specific application-oriented problems. Consequently,…

This survey gives an overview of three central algebraic themes related to the study of splines: duality, group actions, and homology. Splines are piecewise polynomial functions of a prescribed order of smoothness on some subdivided domain…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…

Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with…

In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…

We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…