Related papers: On collection schemes and Gaifman's splitting theo…

We give some necessary and sufficient conditions for the existence of N\'{e}ron models of jacobians of semistable morphisms of arbitrary relative dimension over base schemes of arbitrary dimension. To do this, we introduce a notion of…

We study the problem of optimal estimation and control of linear systems using quantized measurements, with a focus on applications over sensor networks. We show that the state conditioned on a causal quantization of the measurements can be…

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

In this paper, we explore the self-similarity of unions of self-similar sets and their translations. For $N \in \mathbb{N}$ and $0< \beta < 1/(N+1)$, let $\Gamma$ be the self-similar set generated by the IFS \[ \Big\{ \phi_i(x)=\beta x + i…

In this paper we propose an optimization-based framework to multiple object matching. The framework takes maps computed between pairs of objects as input, and outputs maps that are consistent among all pairs of objects. The central idea of…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

A well-known theorem of Fillmore says that if $A\in\operatorname{M}_{n}(K)$ is a non-scalar matrix over a field $K$ and $\gamma_{1},\dots,\gamma_{n}\in K$ are such that $\gamma_{1}+\dots+\gamma_{n}=\operatorname{Tr}(A)$, then $A$ is…

In this paper the coupon collector's problem with group drawings is studied. Assume there are $ n $ different coupons. At each time precisely $ s $ of the $ n $ coupons are drawn, where all choices are supposed to have equal probability.…

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $\rho$-replicable algorithm with sample…

Let $KG$ be a group algebra with $G$ a finite group and $K$ a field and $M$ an indecomposable $KG$-module. We pose the question, whether $Ext_{KG}^1(M,M) \neq 0$ implies that $Ext_{KG}^i(M,M) \neq 0$ for all $i \geq 1$. We give a positive…

Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of species, and this motivates the use of distance measures to…

Although some work has been done on the metamathematics of Metamath, there has not been a clear definition of a model for a Metamath formal system. We define the collection of models of an arbitrary Metamath formal system, both for…

By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…

Coded polynomial aggregation (CPA) in distributed computing systems enables the master to directly recover a weighted aggregation of polynomial computations without individually decoding each term, thereby reducing the number of required…

P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…

We prove a Kaufman-type exceptional set estimate for sets in $\mathbb{R}^n$ that have optimal oracles, a class of sets that strictly contains the analytic sets and sets with equal Hausdorff and packing dimension. As a consequence, we…

Let G be a finite simple group. We show that the commutator map $a : G \times G \to G$ is almost equidistributed as the order of G goes to infinity. This somewhat surprising result has many applications. It shows that for a subset X of G we…

The Coupon Collector's Problem is one of the few mathematical problems that make news headlines regularly. The reasons for this are on one hand the immense popularity of soccer albums (called Paninimania) and on the other hand that no…

We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…