Related papers: Minimum maximal matchings in permutahedra

We determine the submaximal dimensions of the spaces of almost Einstein scales and normal conformal Killing fields for connected conformal manifolds. The results depend on the signature and dimension $n$ of the conformally nonflat conformal…

The study of approximate matching in the Massively Parallel Computations (MPC) model has recently seen a burst of breakthroughs. Despite this progress, however, we still have a far more limited understanding of maximal matching which is one…

We give, for each $k \geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible…

In this paper, we give an improved Morse index bound of minimal hypersurfaces from Almgren-Pitts min-max construction in any closed Riemannian manifold $M^{n+1}$ $(n+1 \geq 3$), which generalizes a result by X. Zhou…

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

The largest minimum weights among quaternary Hermitian linear complementary dual codes are known for dimension $2$. In this paper, we give some conditions for the nonexistence of quaternary Hermitian linear complementary dual codes with…

The minimal faithful permutation degree of a finite group $G$, denote by $\mu(G)$ is the least non-negative integer $n$ such that $G$ embeds inside the symmetric group $\Sym(n)$. In this paper, we outline a Magma proof that 10 is the…

Sublinear time algorithms for approximating maximum matching size have long been studied. Much of the progress over the last two decades on this problem has been on the algorithmic side. For instance, an algorithm of Behnezhad [FOCS'21]…

In this paper we use min-max theory to study the existence free boundary minimal hypersurfaces (FBMHs) in compact manifolds with boundary $(M^{n+1}, \partial M, g)$, where $2\leq n\leq 6$. Under the assumption that $g$ is a local maximizer…

We say that a set is a multiplicative 3-Sidon set if the equation $s_1s_2s_3=t_1t_2t_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of…

We propose a novel neutrino mixing pattern in terms of only two small integers 1 and 2 together with their square roots and the imaginary number $i$. This ansatz is referred to as the "tetra-maximal" mixing because it can be expressed as a…

Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the…

There is a group-theoretical connection between fermion mixing matrices and minimal horizontal symmetry groups. Applying this connection to the tri-bimaximal neutrino mixing matrix, we show that the minimal horizontal symmetry group for…

\emph{A maximal distance minimizer} for a given compact set $M \subset \mathbb{R}^2$ and some given $r > 0$ is a set having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…

Let $S_n$ be the set of permutations on $\{1,\,\dots,\,n\}$ and $\pi\in S_n$. Let $\mathrm{d}(\pi)$ be the arithmetic average of $\{|i-\pi(i)|;\;1\le i\le n\}$. Then $\mathrm{d}(\pi)/n\in[0,\,1/2]$, the expected value of $\mathrm{d}(\pi)/n$…

Permutation arrays under the Kendall-$\tau$ metric have been considered for error-correcting codes. Given $n$ and $d\in [1..\binom{n}{2}]$, the task is to find a large permutation array of permutations on $n$ symbols with pairwise…

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The \emph{minimum positive co-degree} of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of…

The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimum number of edges of $G$ whose deletion results in a subgraph with a unique perfect matching $M$, denoted by $af(G,M)$. When $G$ is a plane bipartite graph, Lei…

An induced matching $M$ in a graph $G$ is a matching in $G$ that is also the edge set of an induced subgraph of $G$. That is, any edge not in $M$ must have no more than one incident vertex saturated by $M$. The maximum size $|M|$ of an…

An ordered matching of size $n$ is a graph on a linearly ordered vertex set $V$, $|V|=2n$, consisting of $n$ pairwise disjoint edges. There are three different ordered matchings of size two on $V=\{1,2,3,4\}$: an alignment…