中文
相关论文

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

200 篇论文

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…

信息论 · 计算机科学 2026-04-10 Xianhong Xie , Yi Ouyang , Shenxing Zhang

We described a minimal separating set for the algebra of $O(F_q)$-invariant polynomial functions of $m$-tuples of two-dimensional vectors over a finite field $F_q$.

交换代数 · 数学 2025-01-15 Artem Lopatin , Pedro Antonio Muniz Martins

Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…

度量几何 · 数学 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

For any block of a finite group over an algebraically closed field of characteristic $2$ which has dihedral, semidihedral, or generalized quaternion defect groups, we determine explicitly the decomposition of the associated diagonal…

表示论 · 数学 2025-09-19 Robert Boltje , Serge Bouc , Deniz Yılmaz

Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…

We say that a set system $\mathcal{F}$ is $k$-completely hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ with intersection $\{v\}$. We determine the minimum size of such set systems on an $n$-element…

组合数学 · 数学 2026-03-10 Dániel Gerbner

Selfridge asked to investigate the pairs $(m,n)$ of natural numbers for which $2^m - 2^n$ divides $x^m - x^n$ for all integers $x.$ This question was answered by different mathematicians by showing that there are only finitely many such…

环与代数 · 数学 2021-07-06 Devendra Prasad

Given a semigroup $S$ and an $n$-partition $\mathcal{P}$ of $S$, $n\in \mathbb{N}$, do there exist $A\in \mathcal{P}$ and a subset $F$ of $S$ such that $S=F ^{-1} \{x \in S: x A \bigcap A\neq\emptyset\}$ and $|F |\leq n$? We give an…

组合数学 · 数学 2015-08-31 Igor Protasov , Ksenia Protasova

We present a new approach to deal with Fraenkel's conjecture, which describes how the integers can be partitioned into sets of rational Beatty sequences, in the case where the numerators of the moduli are equal. We use this approach to give…

数论 · 数学 2017-09-26 Ofir Schnabel , Jamie Simpson

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

组合数学 · 数学 2018-02-02 Emily J. Olson , Bruce E. Sagan

We show that every $(2^n,2^n,2^n,1)$-relative difference set $D$ in $\Z_4^n$ relative to $\Z_2^n$ can be represented by a polynomial $f(x)\in \F_{2^n}[x]$, where $f(x+a)+f(x)+xa$ is a permutation for each nonzero $a$. We call such an $f$ a…

组合数学 · 数学 2013-04-16 Yue Zhou

Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. Define a real-valued weight function on the $1$-dimensional vector spaces of $V$ such that the sum of all weights is zero. Let the weight of a subspace $S$ be…

组合数学 · 数学 2015-02-17 Ferdinand Ihringer

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

群论 · 数学 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

Let $(\mathcal{F},\mathcal{G})$ be a pair of families of $[n]$, where $[n]=\{1,2,...,n\}$. If $A\not\subset B$ and $B\not\subset A$ hold for all $A\in\mathcal{F}$ and $B\in\mathcal{G}$, then $(\mathcal{F},\mathcal{G})$ is called a…

组合数学 · 数学 2023-07-12 Junyao Pan

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…

组合数学 · 数学 2012-08-14 Benjamin Girard

Let $a,b$ be elements in a unital C$^*$-algebra with $0\leq a,b\leq 1$. The element $a$ is absolutely compatible with $b$ if $$\vert a - b \vert + \vert 1 - a - b \vert = 1.$$ In this note, we describe a complete list of absolutely…

算子代数 · 数学 2018-10-31 Nabin K. Jana , Anil K. Karn

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

组合数学 · 数学 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

We prove that there exists uncountably many pairwise disjoint open subsets of the Gelfand space of the measure algebra on any locally compact non-discrete abelian group which shows that this space is not separable (in fact, we prove this…

泛函分析 · 数学 2017-05-17 P. Ohrysko , M. Wojciechowski , Colin C. Graham

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

组合数学 · 数学 2023-12-15 Gyula O. H. Katona , Gyula Y. Katona

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

组合数学 · 数学 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis