Related papers: Minimal unsatisfiability and deficiency: recent de…
Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…
Uniform one-dimensional fragment UF1^= is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified…
The structures for the expression of fault-tolerance provisions into the application software are the central topic of this dissertation. Structuring techniques provide means to control complexity, the latter being a relevant factor for the…
For any class of one-sided $1-\alpha$ confidence intervals with a certain monotonicity ordering on the random confidence limit, the smallest interval, in the sense of the set inclusion for the difference of two proportions of two…
We provide adaptive confidence intervals on a parameter of interest in the presence of nuisance parameters when some of the nuisance parameters have known signs. The confidence intervals are adaptive in the sense that they tend to be short…
Consider an inhomogeneous Poisson process and let $D$ be the first of its epochs which is followed by a gap of size $\ell>0$. We establish a criterion for $D<\infty$ a.s., as well as for $D$ being long-tailed and short-tailed, and obtain…
We show that Wall's D(2) problem, the Realization problem and the Relation Gap problem could all be solved if it could be shown that the deficiency of a certain group is, as intuition would suggest, less than -1. Note the paper has been…
The approximate degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that approximates $f$ pointwise: $|f(x)-p(x)|\leq1/3$ for all $x\in\{0,1\}^n.$ For every $\delta>0,$ we construct CNF…
The Fisher information approximation (FIA) is an implementation of the minimum description length principle for model selection. Unlike information criteria such as AIC or BIC, it has the advantage of taking the functional form of a model…
Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper…
When $\{\alpha_i\}_{1 \leq i \leq m}$ is a sequence of distinct non-zero elements of an integral domain $A$ and $\gamma$ is a common multiple of the $\alpha_i$ in $A$ we obtain, by means of a simple identity for the Vandermonde determinant,…
While explainability is a desirable characteristic of increasingly complex black-box models, modern explanation methods have been shown to be inconsistent and contradictory. The semantics of explanations is not always fully understood - to…
We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.
Empirical causal claims depend on many analyst decisions, from selecting covariates to choosing estimators. Existing robustness tools summarize how results vary across these choices, but, to the best of our knowledge, do not answer:…
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that…
In this paper we characterize sparse solutions for variational problems of the form $\min_{u\in X} \phi(u) + F(\mathcal{A} u)$, where $X$ is a locally convex space, $\mathcal{A}$ is a linear continuous operator that maps into a finite…
To measure the degree of agreement between two observers that independently classify $n$ subjects within $K$ categories, it is common to use different kappa type coefficients, the most common of which is the $\kappa_C$ coefficient (Cohen's…
Asadpour, Feige, and Saberi proved that the integrality gap of the configuration LP for the restricted max-min allocation problem is at most $4$. However, their proof does not give a polynomial-time approximation algorithm. A lot of efforts…
In this paper, we address the accuracy of the results for the overdetermined full rank linear least squares problem. We recall theoretical results obtained in Arioli, Baboulin and Gratton, SIMAX 29(2):413--433, 2007, on conditioning of the…
The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…