Related papers: Getting results with negative thinking
We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…
A collection $\mathcal S$ of equivalence classes of positive definite integral quadratic forms in $n$ variables is called an $n$-exceptional set if there exists a positive definite integral quadratic form which represents all equivalence…
Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…
The goal of this paper is introduction of a concept of natural multidimensional numbers and to construct a generalized Peano arithmetic of these multidimensional numbers. For this purpose we define a polymultiset as a special set-like form…
A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…
One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…
The primary goal of this paper is to provide a general multiplicity estimate. Our main theorem allows to reduce a proof of multiplicity lemma to the study of ideals stable under some appropriate transformation of a polynomial ring. In…
Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…
In this article we introduced algebraic sieves, i.e. selection procedures on a given finite set to extract a particular subset. Such procedures are performed by finite groups acting on the set. They are called sieves because there are…
Binary hashing is a well-known approach for fast approximate nearest-neighbor search in information retrieval. Much work has focused on affinity-based objective functions involving the hash functions or binary codes. These objective…
This article explores the connection between boolean-valued class models of set theory and the theory of arbitrary objects in roughly Kit Fine's sense of the word. In particular, it explores the hypothesis that the set theoretic universe as…
A fuzzy mnesor space is a semimodule over the positive real numbers. It can be used as theoretical framework for fuzzy sets. Hence we can prove a great number of properties for fuzzy sets without refering to the membership functions.
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.
The union of a collection of $n$ sets is generally expressed in terms of a characteristic (indicator) function that contains $2^{n}-1$ terms. In this article, a much simpler expression is found that requires the evaluation of $n$ terms…
The Motzkin numbers can be derived as coefficients of hybrid polynomials. Such an identification allows the derivation of new identities for this family of numbers and offers a tool to investigate previously unnoticed links with the theory…
We propose learning flexible but interpretable functions that aggregate a variable-length set of permutation-invariant feature vectors to predict a label. We use a deep lattice network model so we can architect the model structure to…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…