Related papers: The Projection Problem in Commutative, Positively …

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

Given a finite set, $X$, of points in projective space for which the Hilbert function is known, a standard result says that there exists a subset of this finite set whose Hilbert function is ``as big as possible'' inside $X$. Given a finite…

In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…

A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…

Procrustes problems are matrix approximation problems searching for a~transformation of the given dataset to fit another dataset. They find applications in numerous areas, such as factor and multivariate analysis, computer vision,…

A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…

We consider the class of all commutative reduced rings for which there exists a finite subset T of A such that all projections on quotients by prime ideals of A are surjective when restricted to T. A complete structure theorem is given for…

This paper is devoted to the study of metric subregularity and strong subregularity of any positive order $q$ for set-valued mappings in finite and infinite dimensions. While these notions have been studied and applied earlier for $q=1$…

Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper we study this problem in a dynamic environment with…

We give a construction of the projective indecomposable modules and a description of the quiver for a large class of monoid algebras including the algebra of any finite monoid whose principal right ideals have at most one idempotent…

Let $R$ be an affine algebra over an algebraically closed field of characteristic $0$ with dim$(R)=n$. Let $P$ be a projective $A=R[T_1,\cdots,T_k]$-module of rank $n$ with determinant $L$. Suppose $I$ is an ideal of $A$ of height $n$ such…

Variable order structures model situations in which the comparison between two points depends on a point-to-cone map. In this paper, an inexact projected gradient method for solving smooth constrained vector optimization problems on…

Let $X$ be a unit interval or a unit circle and let $B$ be a $\sigma_p$-unital, purely infinite, simple $C\sp*$-algebra such that its multiplier algebra $M(B)$ has real rank zero. Then we determine necessary and sufficient conditions for a…

We present a mechanism which lifts a multiplicative lattice to a (weak) ideal system on some monoid.

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…

In this short note, we address the discretization of optimal control problems with higher order polynomials. We develop a necessary and sufficient condition to ensure that weak limits of discrete feasible controls are feasible for the…