Related papers: A wild model of linear arithmetic and discretely o…
Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence…
Let $1<p,\,q<\infty$. It is shown for complex scalars that there are no nontrivial $M$-ideals in $L(L_p[0,1])$ if $p\neq 2$, and $K(\ell_p(\ell_q^n)$ is the only nontrivial $M$-ideal in $L(\ell_p(\ell_q^n)$. This proves a conjecture of…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We consider two types of multilinear pseudodifferential operators. First, we prove the boundedness of multilinear pseudodifferential operators with symbols which are only measurable in the spatial variables in weighted Lebesgue spaces.…
The present paper shows meta-programming turn programming, which is rich enough to express arbitrary arithmetic computations. We demonstrate a type system that implements Peano arithmetics, slightly generalized to negative numbers. Certain…
Bayesian networks are a canonical formalism for representing probabilistic dependencies, yet their integration within logic programming frameworks remains a nontrivial challenge, mainly due to the complex structure of these networks. In…
It is shown that each linear operator on a separable Hilbert space which generates a finite type I von Neumann algebra has, up to unitary equivalence, a unique representation as a direct integral of inflations of mutually unitary…
Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…
In this paper, we describe some arithmetic properties of Lame operators with finite dihedral projective monodromy. We take advantage of the deep link with Grothendieck's theory of dessins d'enfants. We focus more particularly on the case of…
In this paper we present a novel numerical method for computing local minimizers of twice smooth differentiable non-linear programming (NLP) problems. So far all algorithms for NLP are based on either of the following three principles:…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…
Separation logic is successful for software verification of heap-manipulating programs. Numbers are necessary to be added to separation logic for verification of practical software where numbers are important. However, properties of the…
We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…
Session types capture precise protocol structure in concurrent programming, but do not specify properties of the exchanged values beyond their basic type. Refinement types are a form of dependent types that can address this limitation,…
LASSO regularization is a popular regression tool to enhance the prediction accuracy of statistical models by performing variable selection through the $\ell_1$ penalty, initially formulated for the linear model and its variants. In this…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
In this paper, we characterize all closed linear operators in a separable Hilbert space which are unitarily equivalent to an integral bi-Carleman operator in $L_2(R)$ with bounded and arbitrarily smooth kernel on $R^2$. In addition, we give…
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…
We consider implicit definability of the standard part {0,1,...} in nonstandard models of Peano arithmetic (PA), and we ask whether there is a model of PA in which the standard part is implicitly definable. In section 1, we define a certain…