Related papers: The Range of a Steiner Operation
The Steenrod problem for closed orientable manifolds was solved completely by Thom. Following this approach, we solve the Steenrod problem for closed orientable orbifolds, proving that the rational homology groups of a closed orientable…
In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for…
For a nonnegative self-adjoint operator $A_0$ acting on a Hilbert space $\mathfrak{H}$ singular perturbations of the form $A_0+V, \ V=\sum_{1}^{n}{b}_{ij}<\psi_j,\cdot>\psi_i$ are studied under some additional requirements of symmetry…
Let $(X,d)$ be a compact metric space, $f:X \mapsto X$ be a continuous map with the specification property, and $\varphi: X \mapsto \IR$ be a continuous function. We prove a variational principle for topological pressure (in the sense of…
In this paper, we will investigate the boundedness of the bi-parameter Fourier integral operators (or FIOs for short) of the following form: $$T(f)(x)=\frac{1}{(2\pi)^{2n}}\int_{\mathbb{R}^{2n}}e^{i\varphi(x,\xi,\eta)}\cdot…
An occurrence of a consecutive permutation pattern $p$ in a permutation $\pi$ is a segment of consecutive letters of $\pi$ whose values appear in the same order of size as the letters in $p$. The set of all permutations forms a poset with…
We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the…
Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations.…
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
Let $F$ be either $\mathbb{R}$ or a finite extension of $\mathbb{Q}_p$, and let $G$ be a finite central extension of the group of $F$-points of a reductive group defined over $F$. Also let $\pi$ be a smooth representation of $G$ (Frechet of…
In this article we construct Symmetric operations for all primes (previously known only for p=2). These unstable operations are more subtle than the Landweber-Novikov operations, and encode all p-primary divisibilities of characteristic…
We investigate the use of invariant polynomials in the construction of data-driven interatomic potentials for material systems. The "atomic body-ordered permutation-invariant polynomials" (aPIPs) comprise a systematic basis and are…
This paper deals with the output regulation problem (ORP) of a linear time-invariant (LTI) system in the presence of sporadically sampled measurement streams with the inter-sampling intervals following a stochastic process. Under such…
The Steiner Tree Problem (STP) in graphs is an important problem with various applications in many areas such as design of integrated circuits, evolution theory, networking, etc. In this paper, we propose an algorithm to solve the STP. The…
Suppose we are given a submodular function $f$ over a set of elements, and we want to maximize its value subject to certain constraints. Good approximation algorithms are known for such problems under both monotone and non-monotone…
The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…
For a graph $G$, a function $\psi$ is called a \emph{bar visibility representation} of $G$ when for each vertex $v \in V(G)$, $\psi(v)$ is a horizontal line segment (\emph{bar}) and $uv \in E(G)$ iff there is an unobstructed, vertical,…
We study optimization problems in which a linear functional is maximized over probability measures that are dominated by a given measure according to an integral stochastic order in an arbitrary dimension. We show that the following four…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
The prize-collecting Steiner tree problem PCSTP is a well-known generalization of the classical Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the latest (11th) DIMACS…