Related papers: Minimal unsatisfiability and deficiency: recent de…
Standard rational expectations models with an occasionally binding zero lower bound constraint either admit no solutions (incoherence) or multiple solutions (incompleteness). This paper shows that deviations from full-information rational…
We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds…
The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
It is shown that an arbitrary function from $D\subset \R^n$ to $\R^m$ will become $C^{0,\alpha}$-continuous in almost every $x\in D$ after restriction to a certain subset with limit point $x$. For $n\geq m$ differentiability can be…
Garcia-Donato et al. (2025) present a methodology for handling missing data in a model selection problem using an objective Bayesian approach. The current comment discusses an alternative, existing objective Bayesian method for this…
Estimation of multiple parameters in an unknown Hamiltonian is investigated. We present upper and lower bounds on the time required to complete the estimation within a prescribed tolerance $\delta$. The lower bound is given on the basis of…
We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…
This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for…
For a text given in advance, the substring minimal suffix queries ask to determine the lexicographically minimal non-empty suffix of a substring specified by the location of its occurrence in the text. We develop a data structure answering…
Orders in number fields provide natural examples of lattices. We ask: what can the successive minima of lattices arising from orders in number fields be? Given an order $\mathcal{O}$ of absolute discriminant $\Delta$ in a degree $n$ number…
Let F be a CNF formula with n variables and m clauses. F is 3-satisfiable if for any 3 clauses in F, there is a truth assignment which satisfies all of them. Lieberherr and Specker (1982) and, later, Yannakakis (1994) proved that in each…
We investigate the structure of the nodal set of solutions to an unstable Alt-Phillips type problem \[ -\Delta u = \lambda_+(u^+)^{p-1}-\lambda_-(u^-)^{q-1} \] where $1 \le p<q<2$, $\lambda_+ >0$, $\lambda_- \ge 0$. The equation is…
Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n log n), where n is the number of states of the…
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several…
The discrepancy of a binary string refers to the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. We provide an investigation of the discrepancy of…
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…
Satisfiability-based automated reasoning is an approach that is being successfully used in software engineering to validate complex software, including for safety-critical systems. Such reasoning underlies many validation activities, from…
Differential equations of the form $f'' + A(z)f' + B(z)f = 0$ (*) are considered, where $A(z)$ and $B(z) \not\equiv 0$ are entire functions. The Lindel\"of function is used to show that for any $\rho \in (1/2, \infty)$, there exists an…
LTL is frequently used to express specifications in many domains such as embedded systems or business processes. Witnesses can help to understand why an LTL specification is satisfiable, and a number of approaches exist to make…