Related papers: AC Simplifications and Closure Redundancies in the…
Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…
We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a…
Narrowing extends term rewriting with the ability to search for solutions to equational problems. While first-order rewriting and narrowing are well studied, significant challenges arise in the presence of binders, freshness conditions and…
The generalized alternating direction method of multipliers (ADMM) of Xiao et al. [{\tt Math. Prog. Comput., 2018}] aims at the two-block linearly constrained composite convex programming problem, in which each block is in the form of…
Analysis of (partial) groundness is an important application of abstract interpretation. There are several proposals for improving the precision of such an analysis by exploiting type information, icluding our own work with Hill and King,…
We prove the following two results. \begin{enumerate} \item Let $\mathcal{A}$ be a unital commutative C*-algebra and $\mathcal{A}^d$ be the standard Hilbert C*-module over $\mathcal{A}$. Let $n\geq d$. If $\{\tau_j\}_{j=1}^n$ is any…
We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…
We often add arithmetic to extend the expressiveness of query languages and study the complexity of problems such as testing query containment and finding certain answers in the framework of answering queries using views. When adding…
We generalize recent results on the monotonicity method, for inclusion detection in the partial data anisotropic Calder\'on problem, to very general non-self-adjoint perturbations. This involves a forward model that accounts for both the…
We show three Hahn-Banach type extension criteria for (sets of) bounded C*-linear maps of Hilbert C*-modules to the underlying C*-algebras of coefficients. One criterion establishes an alternative description of the property of (AW*-)…
We consider the deformation theory of asymptotically conical (AC) and of conically singular (CS) $G_2$-manifolds. In the AC case, we show that if the rate of convergence $\nu$ to the cone at infinity is generic in a precise sense and lies…
We explain how to deduce the degenerate analogue of Ariki's categorification theorem over the ground field C as an application of Schur-Weyl duality for higher levels and the Kazhdan-Lusztig conjecture in finite type A. We also discuss some…
Given a category C of a combinatorial nature, we study the following fundamental question: how does the combinatorial behavior of C affect the algebraic behavior of representations of C? We prove two general results. The first gives a…
We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…
The paper addresses aggregation issues for composite (modular) solutions. A systemic view point is suggested for various aggregation problems. Several solution structures are considered: sets, set morphologies, trees, etc. Mainly, the…
In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
We offer a new perspective and some advances on the 1971 Pearcy--Topping problem: Is every compact operator a commutator of compact operators? Our goal is to analyze and generalize the 1970's work in this area of Joel Anderson combined with…