English
Related papers

Related papers: The 1/3-2/3 conjecture for $N$-free ordered sets

200 papers

Let $K$ denote a field, and let $V$ denote a vector space over $K$ with finite positive dimension. Consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy both conditions below: (i) There exists a basis for $V$…

Combinatorics · Mathematics 2007-05-23 Tatsuro Ito , Kenichiro Tanabe , Paul Terwilliger

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for…

Data Structures and Algorithms · Computer Science 2015-05-18 Michael Hoffmann , Jiří Matoušek , Yoshio Okamoto , Philipp Zumstein

The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…

Combinatorics · Mathematics 2025-07-08 Albin Jaldevik , Jan Snellman

Let $M$ and $N$ be fixed non-negative integer numbers and let $\pi_N$ be a polynomial of degree $N$. Suppose that $(P_n)_{n\geq0}$ and $(Q_n)_{n\geq0}$ are two orthogonal polynomial sequences such that %their derivatives of orders $k$ and…

Classical Analysis and ODEs · Mathematics 2019-06-19 K. Castillo , D. Mbouna

A digraph $D=(V, A)$ has a good pair at a vertex $r$ if $D$ has a pair of arc-disjoint in- and out-branchings rooted at $r$. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has…

Discrete Mathematics · Computer Science 2019-06-20 Gregory Gutin , Yuefang Sun

We prove that any $n$-vertex graph whose complement is triangle-free contains $n^2/12-o(n^2)$ edge-disjoint triangles. This is tight for the disjoint union of two cliques of order $n/2$. We also prove a corresponding stability theorem, that…

Combinatorics · Mathematics 2021-01-27 Mykhaylo Tyomkyn

We show that if the difference of two elements of a set $A \subseteq [N]$ is never one less than a prime number, then $|A| = O (N \exp (-c (\log N)^{1/3}))$ for some absolute constant $c>0$.

Classical Analysis and ODEs · Mathematics 2020-03-05 Ruoyi Wang

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A : V \to V$ and $A^* : V \to V$ that satisfy (i) and (ii) below: (i) There exists a…

Rings and Algebras · Mathematics 2007-05-23 Kazumasa Nomura , Paul Terwilliger

A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…

Combinatorics · Mathematics 2015-04-07 S. Nkonkobe , V. Murali

A balanced configuration of points on the sphere $S^2$ is a (finite) set of points which are in equilibrium if they act on each other according any force law dependent only on the distance between two points. The configuration is…

Metric Geometry · Mathematics 2022-08-05 Laura Pierson , Julian Wellman

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $a\geq3$, satisfying $d(u)+d(v)\geq 3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a…

Combinatorics · Mathematics 2018-05-25 Janusz Adamus

An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…

Combinatorics · Mathematics 2023-01-09 Davoud Abdi

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area…

Combinatorics · Mathematics 2020-07-15 Dániel Gerbner , Dániel Nagy , Balázs Patkós , Máté Vizer

A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most $(1+o(1))\binom{n}{n/2}$.…

Combinatorics · Mathematics 2016-01-15 Jozsef Balogh , Adam Zsolt Wagner

In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…

Rings and Algebras · Mathematics 2014-03-26 Jouni Järvinen , Sándor Radeleczki , Laura Veres

Let K denote a field and let $V$ denote a vector space over K with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ which satisfy the following two properties: (i) There exists a…

Quantum Algebra · Mathematics 2007-05-23 Paul Terwilliger , Raimundas Vidunas

There exists an absolute constant $C$ with the following property. Let $A \subseteq \mathbb{F}_p$ be a set in the prime order finite field with $p$ elements. Suppose that $|A| > C p^{5/8}$. The set \[ (A \pm A)(A \pm A) = \{(a_1 \pm…

Combinatorics · Mathematics 2016-02-08 Giorgis Petridis

We study the relationship between Bell states, finite groups and complete sets of bases. We show how to obtain a set of N+1 bases in which Bell states are invariant. They generalize the X, Y and Z qubit bases and are associated to groups of…

Quantum Physics · Physics 2016-09-08 Thomas Durt

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Group Theory · Mathematics 2021-07-01 Kanto Irimoto , Enrique Torres-Giese

Balanced weighing matrices with parameters $$ \left(1+18\cdot\frac{9^{m+1}-1}{8},9^{m+1},4\cdot 9^m\right), $$ for each nonzero integer $m$ is constructed. This is the first infinite class not belonging to those with classical parameters.…

Combinatorics · Mathematics 2021-10-01 Hadi Kharaghani , Thomas Pender , Sho Suda