Related papers: Twenty Open Problems in Enumeration of Matchings: …
In this report, we aim to exemplify concentration inequalities and provide easy to understand proofs for it. Our focus is on the inequalities which are helpful in the design and analysis of machine learning algorithms.
Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open…
We present a treasure trove of open problems in matrix and operator inequalities, of a functional analytic nature, and with various degrees of hardness.
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.
This paper has been merged into 1110.4604.
In this note we briefly survey and propose some open problems related to isoparametric theory.
This review aims to provide a comprehensive update on the progress made on the Sequential Testing problem (STP) in the last 20 years after the review, [1] was published. Many studies have provided new theoretical results, extensions of the…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
Matching is a task at the heart of any data integration process, aimed at identifying correspondences among data elements. Matching problems were traditionally solved in a semi-automatic manner, with correspondences being generated by…
The aim of this paper is to share with the mathematical community a list of 33 problems that I have found along the years during my research. I believe that it is worth to think about them and, hopefully, it will be possible either to solve…
We give an informal, expository account of a project to construct completions of period maps.
Entity Resolution (ER) is typically implemented as a batch task that processes all available data before identifying duplicate records. However, applications with time or computational constraints, e.g., those running in the cloud, require…
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computational complexity.
We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries.
The paper describes our experience collecting a new dataset for the light source estimation problem in a single image. The analysis of existing color targets is presented along with various technical and scientific aspects essential for…
We introduce an alternative to the method of matched asymptotic expansions. In the "traditional" implementation, approximate solutions, valid in different (but overlapping) regions are matched by using "intermediate" variables. Here we…
We present recent results on optimal algorithms for numerical integration and several open problems. The paper has six parts: 1. Introduction 2. Lower Bounds 3. Universality 4. General Domains 5. iid Information 6. Concluding Remarks
Work in progress concerning alternative formalizations of arithmetic.