相关论文: Finding a perfect matching of $\mathbb{F}_2^n$ wit…

An important theorem by Timofte states that nonnegativity of real $n$-variate symmetric polynomials of degree $d$ can be decided at test sets given by all points with at most $\lfloor\frac{d}{2}\rfloor$ distinct components. However, if the…

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and $(1-o_n(1))\cdot 2^{n^2}$ monomials with non-zero coefficients. In contrast, we show…

We propose a new class of primal-dual Fejer monotone algorithms for solving systems of com- posite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the…

Let $F^n$ be the binary $n$-cube, or binary Hamming space of dimension $n$, endowed with the Hamming distance, and ${\cal E}^n$ (respectively, ${\cal O}^n$) the set of vectors with even (respectively, odd) weight. For $r\geq 1$ and $x\in…

In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…

Let $\mathbb{F}$ be an infinite field. Let $n$ be a positive integer and let $1\leq d\leq n$. Let $\vec{f}_1, \vec{f}_2, \ldots, \vec{f}_{d-1} \in \mathbb{F}^{n}$ be $d-1$ linearly independent vectors. Let…

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…

This article contains a proof of the MDS conjecture for $k \leq 2p-2$. That is, that if $S$ is a set of vectors of ${\mathbb F}_q^k$ in which every subset of $S$ of size $k$ is a basis, where $q=p^h$, $p$ is prime and $q$ is not and $k \leq…

Burkill and Mirsky, and Kalmanson, prove independently that, for every $r\ge 2, n\ge 1$, there is a sequence of $r^{2^n}$ vectors in $\mathbb R^n$, which does not contain a subsequence of $r+1$ vectors $v^1, v^2,\dots,v^{r+1}$ such that,…

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…

We introduce the notion of r-defectivity for a vector bundle on a quasi-projective variety. Using this tool, we prove several previously unknown cases of Fr\"oberg's conjecture and also of the postulation problem for fat point schemes. Our…

According to [1] an $n$-dimensional $\mathcal{N}$--set is a compact subset $A$ of $\mathbb{R}^n$ such that for every $x$ in $\mathbb{R}^n$ there is $y$ in $A$ with $y-x$ in $\mathbb{Z}^n$. We prove that every two dimensional…

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…

We compute the Hausdorff dimension of the set of $\psi$-exactly approximable vectors, in the simultaneous case, in dimension strictly larger than $2$ and for approximating functions $\psi$ with order at infinity less than or equal to $-2$.…

Let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of weight $n$. Recently, Hirschhorn and Sellers, Yao, and Xia established a number of congruences modulo 2 and 5, 4 and 8, and 25 for $f(n)$, respectively. In this…

We study the general norm optimization for combinatorial problems, initiated by Chakrabarty and Swamy (STOC 2019). We propose a general formulation that captures a large class of combinatorial structures: we are given a set $U$ of $n$…