中文
相关论文

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

200 篇论文

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

数论 · 数学 2016-03-22 Christian Reiher

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

环与代数 · 数学 2023-03-03 Clément de Seguins Pazzis

Tverberg's theorem asserts that every (k-1)(d+1)+1 points in R^d can be partitioned into k parts, so that the convex hulls of the parts have a common intersection. Calder and Eckhoff asked whether there is a purely combinatorial deduction…

组合数学 · 数学 2010-09-14 Boris Bukh

We propose a simple deterministic test for deciding whether or not an element $a \in \F_{2^n}^{\times}$ or $\F_{3^n}^{\times}$ is a zero of the corresponding Kloosterman sum over these fields, and rigorously analyse its runtime. The test…

数论 · 数学 2012-04-24 Omran Ahmadi , Robert Granger

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

计算复杂性 · 计算机科学 2017-12-27 Grzegorz Guśpiel

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

组合数学 · 数学 2024-06-04 Cristina Ballantine , Amanda Welch

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

组合数学 · 数学 2020-02-20 Jia Huang

We consider frames in a finite-dimensional Hilbert space where frames are exactly the spanning sets of the vector space. A factor poset of a frame is defined to be a collection of subsets of $I$, the index set of our vectors, ordered by…

In this paper, we propose a family of nonconforming finite elements for $2m$-th order partial differential equations in $\mathbb{R}^n$ on simplicial grids when $m=n+1$. This family of nonconforming elements naturally extends the elements…

数值分析 · 数学 2018-01-10 Shuonan Wu , Jinchao Xu

We study modal separability for fixpoint formulae: given two mutually exclusive fixpoint formulae $\varphi,\varphi'$, decide whether there is a modal formula $\psi$ that separates them, that is, that satisfies…

计算机科学中的逻辑 · 计算机科学 2024-06-04 Jean Christoph Jung , Jędrzej Kołodziejski

Let $K$ be a compact convex set in $\mathbb{R}^2$ and let $\mathcal{F}_1, \mathcal{F}_2, \mathcal{F}_3$ be finite families of translates of $K$ such that $A \cap B \neq \emptyset$ for every $A \in \mathcal{F}_i$ and $B \in \mathcal{F}_j$…

组合数学 · 数学 2023-06-21 Cuauhtemoc Gomez-Navarro , Edgardo Roldán-Pensado

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

组合数学 · 数学 2025-11-27 Thang Pham , Semin Yoo

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

组合数学 · 数学 2023-09-06 Hunter Waldron

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…

组合数学 · 数学 2016-11-22 István Tomon

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

组合数学 · 数学 2012-08-23 William Y. C. Chen , Ae Ja Yee , Albert J. W. Zhu

Ten years ago, Gla{\ss}er, Pavan, Selman, and Zhang [GPSZ08] proved that if P $\neq$ NP, then all NP-complete sets can be simply split into two NP-complete sets. That advance might naturally make one wonder about a quite different potential…

计算复杂性 · 计算机科学 2018-07-31 Lane A. Hemaspaandra , Holger Spakowski

We elucidate the vector space (twisted relative cohomology) that is Poincar\'e dual to the vector space of Feynman integrals (twisted cohomology) in general spacetime dimension. The pairing between these spaces - an algebraic invariant…

高能物理 - 理论 · 物理学 2022-01-05 Simon Caron-Huot , Andrzej Pokraka

The Mishchenko-Fomenko conjecture says that for each real or complex finite-dimensional Lie algebra $\goth g$ there exists a complete set of commuting polynomials on its dual space $\goth g^*$. In terms of the theory of integrable…

微分几何 · 数学 2012-06-19 Alexey Bolsinov

Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…

信息论 · 计算机科学 2010-12-17 Arya Mazumdar , Ron M. Roth , Pascal O. Vontobel

Two related questions are discussed. The first is when reflection symmetry in a finite set of $i$-dimensional subspaces, $i\in \{1,\dots,n-1\}$, implies full rotational symmetry, i.e., the closure of the group generated by the reflections…

度量几何 · 数学 2022-05-06 Gabriele Bianchi , Richard J. Gardner , Paolo Gronchi