Related papers: Betweenness and Nonbetweenness

We introduce and study a class of betweenness algebras-Boolean algebras with binary operators, closely related to ternary frames with a betweenness relation. From various axioms for betweenness, we chose those that are most common, which…

Two subsets $A, B$ of the plane are betweenness isomorphic if there is a bijection $f\colon A\to B$ such that, for every $x,y,z\in A$, the point $f(z)$ lies on the line segment connecting $f(x)$ and $f(y)$ if and only if $z$ lies on the…

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let $B_n$ be the number of nonisomorphic…

In 2017, Andrews, Dixit, Schultz and Yee introduced the function $\overline{\textrm{spt}}_\omega(n)$, which denotes the number of smallest parts in the overpartitions of $n$ in which the smallest part is always overlined and all odd parts…

Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learning. Measuring the…

Montgomery's pair correlation conjecture predicts the asymptotic behavior of the function $N(T,\beta)$ defined to be the number of pairs $\gamma$ and $\gamma'$ of ordinates of nontrivial zeros of the Riemann zeta-function satisfying…

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $\|n\| \ge 3\log_3 n$ for all $n$. Define the defect of…

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…

In a recent breakthrough, Adiprasito, Avvakumov, and Karasev constructed a triangulation of the $n$-dimensional real projective space with a subexponential number of vertices. They reduced the problem to finding a small downward closed…

Given two phylogenetic trees with the $\{1, \ldots, n\}$ leaf-set the maximum agreement subtree problem asks what is the maximum size of the subset $A \subseteq \{1, \ldots, n\}$ such that the two trees are equivalent when restricted to…

Let $W_{\infty}(\beta)$ be the limit of the Biggins martingale $W_n(\beta)$ associated to a supercritical branching random walk with mean number of offspring $m$. We prove a functional central limit theorem stating that as $n\to\infty$ the…

The intermediate dimensions are a family of dimensions which interpolate between the Hausdorff and box dimensions of sets. We prove a necessary and sufficient condition for a given function $h(\theta)$ to be realized as the intermediate…

Let $z=x+iy \in \mathbb{H}:=\{z= x+ i y\in\mathbb{C}: y>0\}$ and $ \theta (\alpha;z)=\sum_{(m,n)\in\mathbb{Z}^2 } e^{-\alpha \frac{\pi }{y }|mz+n|^2}$ be the theta function associated with the lattice $L ={\mathbb Z}\oplus z{\mathbb Z}$. In…

In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to…

This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as…

We consider a simple model of imprecise comparisons: there exists some $\delta>0$ such that when a subject is given two elements to compare, if the values of those elements (as perceived by the subject) differ by at least $\delta$, then the…

Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…

Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature…

Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, ranging from routing to service placement. However, as…