Related papers: The B. B. Newman Spelling Theorem

In this paper, the Neyman-Pearson lemma for general sublinear expectations is studied. We weaken the assumptions for sublinear expectations in [1] and give a completely new method to study this problem. Applying Mazur-Orlicz Theorem and the…

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

Sentence ordering is a general and critical task for natural language generation applications. Previous works have focused on improving its performance in an external, downstream task, such as multi-document summarization. Given its…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…

The problem of ranking can be described as follows. We have a set of combinatorial objects $S$, such as, say, the k-subsets of n things, and we can imagine that they have been arranged in some list, say lexicographically, and we want to…

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…

The strong factorization conjecture states that a proper birational map between smooth algebraic varieties over a field of characteristic zero can be factored as a sequence of smooth blowups followed by a sequence of smooth blowdowns. We…

We critically review three major theories of machine learning and provide a new theory according to which machines learn a function when the machines successfully compute it. We show that this theory challenges common assumptions in the…

The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…

We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on…

We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…

Each number field has an associated finite abelian group, the class group, that records certain properties of arithmetic within the ring of integers of the field. The class group is well-studied, yet also still mysterious. A central…

A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…

Let G be a Frobenius group with the Frobenius kernel N. Applying character theory, G. Frobenius proved that N was a normal subgroup of G in the year 1901. This is a celebrated application of the character theory of finite groups. In this…

A popular scientific contribution should not contradict any established facts and ought to be understandable. I complied with both these requirements and am offering a sufficiently full introduction to probability theory. Furthermore, I…

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…

A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important applications in number theory and group theory. In 1989…

Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…

This paper have two parts. In the first part we discuss word embeddings. We discuss the need for them, some of the methods to create them, and some of their interesting properties. We also compare them to image embeddings and see how word…