English
Related papers

Related papers: Transporting continuity properties from a poset to…

200 papers

In networks of mobile autonomous agents, e.g. for data acquisition, we may wish to maximize data transfer or to reliably transfer a minimum amount of data, subject to quality of service or energy constraints. These requirements can be…

Information Theory · Computer Science 2020-01-14 Omar James Faqir , Eric C. Kerrigan , Deniz Gündüz

In the first half this paper, we generalize the theory of layer points for Lesnick- (or degree-Rips-) complexes to the more general context of $\vec{v}$-hierarchical clusterings. Layer points provide a compressed description of a…

Statistics Theory · Mathematics 2021-09-07 Katharine L. M. Adamyk

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

Combinatorics · Mathematics 2019-08-20 Frank a Campo

The article continues the study of the 'regular' arrangement of a collection of sets near a point in their intersection. Such regular intersection or, in other words, transversality properties are crucial for the validity of qualification…

Optimization and Control · Mathematics 2018-05-15 Alexander Y. Kruger

Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…

Probability · Mathematics 2023-09-01 Muneya Matsui , Toshiro Watanabe

In this paper we establish connections between covers of $\mathbb Z$ by residue classes and subset sums in a field. Suppose that $A_0=\{a_s(n_s)\}_{s=0}^k$ covers each integer at least $p$ times with the residue class…

Number Theory · Mathematics 2020-08-11 Zhi-Wei Sun

We prove that for every poset $P$, there is a constant $C$ such that the size of any family of subsets of $[n]$ that does not contain $P$ as an induced subposet is at most $C{\binom{n}{\lfloor\frac{n}{2}\rfloor}}$, settling a conjecture of…

Combinatorics · Mathematics 2014-09-11 Abhishek Methuku , Dömötör Pálvölgyi

It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset…

Discrete Mathematics · Computer Science 2021-01-29 Christine T. Cheng , Will Rosenbaum

All wavelets can be associated to a multiresolution like structure, i.e. an incr easing sequence of subspaces of L^2(R). We consider the interaction of a wavel et and the translation operator in terms of which of the subspaces in this multi…

Functional Analysis · Mathematics 2007-05-23 Sharon Schaffer , Eric Weber

We present a general (i.e., independent of the underlying model) interpolation technique based on optimal transportation of Gaussian models for parametric advection-dominated problems. The approach relies on a scalar testing function to…

Numerical Analysis · Mathematics 2022-10-19 Angelo Iollo , Tommaso Taddei

For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…

Combinatorics · Mathematics 2021-11-30 Swee Hong Chan , Igor Pak , Greta Panova

The consecutive pattern poset is the infinite partially ordered set of all permutations where $\sigma\le\tau$ if $\tau$ has a subsequence of adjacent entries in the same relative order as the entries of $\sigma$. We study the structure of…

Combinatorics · Mathematics 2019-05-27 Sergi Elizalde , Peter R. W. McNamara

We discuss the structure of teleportation. By associating matrices to the preparation and measurement states, we show that for a unitary transformation M there is a full teleportation procedure for obtaining M|S> from a given state |S>. The…

Quantum Physics · Physics 2009-11-10 Louis H. Kauffman

One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these…

Algebraic Topology · Mathematics 2026-05-20 Claire Amiot , Thomas Brüstle , Eric J. Hanson

We describe a general approach to the theory of self consistent transfer operators. These operators have been introduced as tools for the study of the statistical properties of a large number of all to all interacting dynamical systems…

Dynamical Systems · Mathematics 2022-07-13 Stefano Galatolo

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Theoretical Economics · Economics 2021-11-17 Leandro Gorno , Alessandro Rivello

In this article we show that some recent results on the existence of best proximity points can be obtained from the same result in fixed point theory.

Functional Analysis · Mathematics 2013-01-31 Ali Abkar , Moosa Gabeleh

We investigate the question of when a topological space $X$ has the $\textit{Generalized Bolzano-Weierstrass property}$: every sequence of subsets of $X$ has a convergent subsequence (in the sense of Kuratowski).

General Topology · Mathematics 2021-05-21 Ramiro de la Vega

We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…

Algebraic Topology · Mathematics 2014-05-13 Peter Bubenik , Jonathan A. Scott

One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu
‹ Prev 1 4 5 6 7 8 10 Next ›