Related papers: The Range of a Steiner Operation

For a locally compact group $G$ and $1 < p < \infty,$ let $B_p(G)$ denote the $p$-analog of the Fourier-Stieltjes algebra $B(G) \, (\text{or} \, B_2(G))$. Let $r: B_p(G) \to B_p(H)$ be the restriction map given by $r(u) = u|_H$ for any…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

This note provides an extension of the constructive loop vertex expansion to stable interactions of arbitrarily high order, opening the way to many applications. We treat in detail the example of the $(\bar \phi \phi)^p$ field theory in…

A spanner is a sparse subgraph of a given graph $G$ which preserves distances, measured w.r.t.\ some distance metric, up to a multiplicative stretch factor. This paper addresses the problem of constructing graph spanners w.r.t.\ the group…

Power iteration has been generalized to solve many interesting problems in machine learning and statistics. Despite its striking success, theoretical understanding of when and how such an algorithm enjoys good convergence property is…

We study stochastic monotonicity and propagation of order for Markov processes with respect to stochastic integral orders characterized by cones of functions satisfying $\Phi f \geq 0$ for some linear operator $\Phi$. We introduce a new…

Conditions for a composition operator on the Hardy space of the disk to have closed range or be similar to an isometry are well known. We provide such conditions for composition operators on the Hardy space of the upper half-plane. We also…

Motivated by several applications, we consider the problem of randomly rounding a fractional solution in a matroid (base) polytope to an integral one. We consider the pipage rounding technique and also present a new technique, randomized…

Let $G$ be a graph. The Steiner distance of $W\subseteq V(G)$ is the minimum size of a connected subgraph of $G$ containing $W$. Such a subgraph is necessarily a tree called a Steiner $W$-tree. The set $A\subseteq V(G)$ is a $k$-Steiner…

The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have demonstrated to play a…

Let ${\mathcal A}\subset {\mathcal P}(X)$, $\emptyset, X\in {\mathcal A}$, ${\mathcal A}$ being closed under finite intersections. If $\psi={o},\omega,\gamma$, then $\Psi({\mathcal A})$ is the family of those $\psi$-covers ${\mathcal U}$…

We study isometric actions of Steinberg groups on Hadamard manifolds. We prove some rigidity properties related to these actions. In Particular we show that every isometric action of $St_n(F_p\langle t_1,\ldots ,t_k \rangle)$ on Hadamard…

We continue the study initiated by H. S. Shapiro on Fischer decompositions of entire functions, showing that such decomposition exist in a weak sense (we do not prove uniqueness) under hypotheses regarding the order of the entire function…

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 P(n) including…

Characterization results for equality cases and for rigidity of equality cases in Steiner's perimeter inequality are presented. (By rigidity, we mean the situation when all equality cases are vertical translations of the Steiner's symmetral…

Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…

In this paper, we consider the optimization problem Submodular Cover (SCP), which is to find a minimum cardinality subset of a finite universe $U$ such that the value of a submodular function $f$ is above an input threshold $\tau$. In…

In this paper, we take an in-depth look at the complexity of a hitherto unexplored Multiobjective Spanner (MSp) problem. The MSp is a multiobjective generalization of the well-studied Minimum t-Spanner problem. This multiobjective approach…

Integration By Parts (IBP) is an important method for computing Feynman integrals. This work describes a formulation of the theory involving a set of differential equations in parameter space, and especially the definition and study of an…

In [1], we inaugurated a new area of optimal control (OC) theory that we called "periodic fractional OC theory," which was developed to find optimal ways to periodically control a fractional dynamic system. The typical mathematical…