中文
相关论文

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

200 篇论文

In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…

数据结构与算法 · 计算机科学 2024-11-26 Frederik Glitzner , David Manlove

A vector space partition $\mathcal{P}$ in $\mathbb{F}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of $\mathbb{F}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every…

组合数学 · 数学 2019-01-17 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz

Let ${\Bbb F}_2$ be the finite field of two elements, ${\Bbb F}_2^n$ be the vector space of dimension $n$ over ${\Bbb F}_2$. For sets $A,\,B\subseteq{\Bbb F}_2^n$, their sumset is defined as the set of all pairwise sums $a+b$ with $a\in…

数论 · 数学 2012-05-29 Chaohua Jia

Any complex-valued polynomial on $(\mathbb{R}^n)^k$ decomposes into an algebraic combination of $O(n)$-invariant polynomials and harmonic polynomials. This decomposition, separation of variables, is granted to be unique if $n \geq 2k-1$. We…

表示论 · 数学 2024-04-29 Daniel Beďatš

We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous…

组合数学 · 数学 2021-06-01 Mihai Ciucu , Christian Krattenthaler

We give a new proof of Fejes T\'oth's zone conjecture: for any sequence $v_1,v_2,...,v_n$ of unit vectors in a real Hilbert space $\mathcal{H}$, there exists a unit vector $v$ in $\mathcal{H}$ such that \begin{equation*} |\langle v_k,v…

泛函分析 · 数学 2020-11-04 Oscar Ortega-Moreno

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

数据结构与算法 · 计算机科学 2020-09-11 Fedor V. Fomin , Petr A. Golovach , Lars Jaffke , Geevarghese Philip , Danil Sagunov

Hirschhorn and Sellers studied arithmetic properties of the number of partitions with odd parts distinct. In another direction, Hammond and Lewis investigated arithmetic properties of the number of bipartitions. In this paper, we consider…

组合数学 · 数学 2010-04-06 William Y. C. Chen , Bernard L. S. Lin

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…

表示论 · 数学 2021-11-16 Artem Lopatin , Fabian Reimers

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

历史与综述 · 数学 2017-08-04 Eunice Krinsky , Serban Raianu , Alexander Wittmond

We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the…

组合数学 · 数学 2007-05-23 Christian Krattenthaler

Let $\mathscr{F}$ and $\mathscr{G}$ be families of $k$- and $\ell$-dimensional subspaces, respectively, of a given $n$-dimensional vector space over a finite field $\mathbb{F}_q$. Suppose that $x \cap y \ne 0$ for all $x \in \mathscr{F}$…

组合数学 · 数学 2014-03-27 Sho Suda , Hajime Tanaka

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

组合数学 · 数学 2018-10-09 Jane Y. X. Yang

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

最优化与控制 · 数学 2017-08-01 Jiawang Nie , Jinling Zhao

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

数论 · 数学 2019-02-20 Alexei Entin

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

组合数学 · 数学 2020-06-23 Mozhgan Mirzaei , Andrew Suk

This article determines all the solutions in the finite field $GF{2^{4n}}$ of the equation $x^{2^{3n}+2^{2n}+2^{n}-1}+(x+1)^{2^{3n}+2^{2n}+2^{n}-1}=b$. Specifically, we explicitly determine the set of $b$'s for which the equation has $i$…

信息论 · 计算机科学 2022-04-12 Kwang Ho Kim , Sihem Mesnager

In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…

组合数学 · 数学 2022-05-25 Riccardo Aragona , Roberto Civino , Norberto Gavioli , Carlo Maria Scoppola

Given a subset $S$ of the non-identity elements of the dihedral group of order $2m$, is it possible to order the elements of $S$ so that the partial products are distinct? This is equivalent to the sequenceability of the group when $|S| =…

组合数学 · 数学 2019-04-17 M. A. Ollis

Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning. The first algorithm is for testing…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Dai Tri Man Le , Stephen A. Cook