English
Related papers

Related papers: Variations on the Bollob\'as set-pair theorem

200 papers

In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…

Algebraic Topology · Mathematics 2008-07-10 Pavle V. M. Blagojevic , Aleksandra S. Dimitrijevic Blagojevic , John McCleary

A set $S \subseteq V$ of the graph $G = (V, E)$ is called a $[1, 2]$-set of $G$ if any vertex which is not in $S$ has at least one but no more than two neighbors in $S$. A set $S \subseteq V$ is called a $[1, 2]$-total set of $G$ if any…

In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value of a set function…

Optimization and Control · Mathematics 2025-02-27 Arjun Ramachandra , Karthik Natarajan

The Bell inequalities in three and four correlations are re-derived in general forms showing that three and four data sets, respectively, identically satisfy them regardless of whether they are random, deterministic, measured, predicted, or…

Quantum Physics · Physics 2020-06-24 Louis Sica

A subset $S$ of the unit sphere $\mathbb{S}^2$ is called orthogonal-pair-free if and only if there do not exist two distinct points $u, v \in S$ at distance $\frac{\pi}{2}$ from each other. Witsenhausen \cite{witsenhausen} asked the…

Computational Geometry · Computer Science 2024-03-28 Apurva Mudgal

Several methods of preference modeling, ranking, voting and multi-criteria decision making include pairwise comparisons. It is usually simpler to compare two objects at a time, furthermore, some relations (e.g., the outcome of sports…

Optimization and Control · Mathematics 2025-09-04 László Gyarmati , Éva Orbán-Mihálykó , Csaba Mihálykó , Sándor Bozóki , Zsombor Szádoczki

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

Metric Geometry · Mathematics 2025-10-07 P. Erdős , E. Makai, , J. Pach

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

Logic · Mathematics 2021-02-09 Howard Becker , Randall Dougherty

System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…

Logic in Computer Science · Computer Science 2021-07-28 Cristian F. Sottile , Alejandro Díaz-Caro , Pablo E. Martínez López

We use Salem's method to prove that there is a lower bound for partial sums of series of bi-orthogonal vectors in a Hilbert space, or the dual vectors. This is applied to some lower bounds on $L^{1}$ norms for orthogonal expansions. There…

Classical Analysis and ODEs · Mathematics 2009-03-02 Christopher Meaney

A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with…

Logic · Mathematics 2016-05-31 Ohad Drucker

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

Combinatorics · Mathematics 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

We study increasing subsequences (IS) for an ensemble of sequences given by permutation of numbers {1,2,...,n}. We consider a Boltzmann ensemble at temperature T. Thus each IS appears with the corresponding Boltzmann probability where the…

Disordered Systems and Neural Networks · Physics 2023-03-08 P. Krabbe , H. Schawe , A. K. Hartmann

The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…

Combinatorics · Mathematics 2019-02-20 J. Robert Johnson , Imre Leader , Paul A. Russell

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

The classical Brunn-Minkowski inequality states that for $A_1,A_2\subset\R^n$ compact, $$ |A_1+A_2|^{1/n}\ge |A_1|^{1/n}+|A_2|^{1/n}\eqno(1) $$ where $|\cdot|$ denotes the Lebesgue measure on $\R^n$. In 1986 V. Milman {\bf [Mil 1]}…

Functional Analysis · Mathematics 2016-09-06 Jesus Bastero , J. Bernues , A. Pena

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. We prove that if a sequence $B=\{11\leq b_1<b_2<\cdots\}$ satisfies $b_2=3b_1+5$, $b_3=3b_2+2$ and $b_{n+1}=3b_n+4b_{n-1}$ for all $n\geq 3$, then there is a sequence of…

Number Theory · Mathematics 2020-05-20 Min Tang , Hongwei Xu

In these notes we prove two main results: 1) It is well-known that two strongly continuous $E_0$-semigroups on $B(H)$ can be paired if and only if they have anti-isomorphic Arveson systems. For a new notion of pairing (which coincides only…

Operator Algebras · Mathematics 2025-09-05 Michael Skeide

A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…

Combinatorics · Mathematics 2007-05-23 Diane Maclagan

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

Combinatorics · Mathematics 2023-04-05 Nicolas Nagel