中文
相关论文

相关论文: Inclusion Matrices and the MDS Conjecture

200 篇论文

In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…

组合数学 · 数学 2025-07-11 Jeck Lim , Jiaxi Nie , Ji Zeng

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of $q$-ary MDS self-dual codes for…

信息论 · 计算机科学 2016-12-26 Lingfei Jin , Chaoping Xing

Let S_d be the symmetric group on d letters and let k be a field of characteristic p>2. Tensoring an irreducible S_d module with the sign representation defines an involution on the p-regular partitions of d. It is suprisingly difficult to…

群论 · 数学 2007-05-23 J. Brundan , J. Kujawa

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

组合数学 · 数学 2020-06-26 Carly Bodkin , Anita Liebenau , Ian M. Wanless

An $r$-matrix is a matrix with symbols in $\{0,1,\dots,r-1\}$. A matrix is simple if it has no repeated columns. Let the support of a matrix $F$, $\text{supp}(F)$ be the largest simple matrix such that every column in $\text{supp}(F)$ is in…

组合数学 · 数学 2019-12-23 Keaton Ellis , Baian Liu , Attila Sali

New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853 <= q <= 4561 and q\in T1\cup T2 where T1={173,181,193,229,243,257,271,277,293,343,373,409,443,449,457,…

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

数论 · 数学 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

数论 · 数学 2014-01-14 Dzmitry Badziahin , Jason Levesley , Sanju Velani

A real matrix $Q$ is quasi-orthogonal if $Q^{\top}Q=qI$, for some positive real number $q$. We prove that any $n\times n$ skew-symmetric matrix $S$ is a principal sub-matrix of a skew-symmetric quasi-orthogonal matrix $Q$, called a…

组合数学 · 数学 2024-10-28 Abderrahim Boussaïri , Brahim Chergui , Zaineb Sarir , Mohamed Zouagui

Let $U_n$ denote the group of upper $n \times n$ unitriangular matrices over a fixed finite field $\mathbb{F}$ of order $q$. That is, $U_n$ consists of upper triangular $n \times n$ matrices having every diagonal entry equal to $1$. It is…

群论 · 数学 2023-05-23 Maria Loukaki

We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number $n_0\in \mathbb{N}$ such that for any n>n_0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of…

组合数学 · 数学 2017-07-31 Jan Hladky , Diana Piguet

More than 50 years ago, Erd\H os asked the following question: what is the maximum size of a family $\mathcal F$ of $k$-element subsets of an $n$-element set if it has no $s+1$ pairwise disjoint sets? This question attracted a lot of…

组合数学 · 数学 2021-09-14 Peter Frankl , Andrey Kupavskii

The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. A family Fc is called Frankl-complete (or FC-family) if in every…

计算机科学中的逻辑 · 计算机科学 2019-02-26 Filip Marić , Bojan Vučković , Miodrag Živković

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

组合数学 · 数学 2013-05-06 Richard P. Anstee , Linyuan Lu

This work shows a study about the structure of the cycles contained in a Minimal Strong Digraph (MSD). The structure of a given cycle is determined by the strongly connected components (or strong components, SCs) that appear after…

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

数论 · 数学 2018-08-29 Tom Fischer

A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a…

组合数学 · 数学 2024-03-06 Zazil Santizo Huerta , Melissa Keranen , Vladimir Tonchev

In 1920, MacMahon introduced two families of $q$-series to study divisor sums. Recent work has shown that MacMahon's $q$-series are closely connected to overpartitions and $3$-colored partitions. Merca introduced truncated forms of…

组合数学 · 数学 2025-09-09 Ji-Cai Liu

We show any matrix of rank $r$ over $\mathbb{F}_q$ can have $\leq \binom{r}{k}(q-1)^k$ distinct columns of weight $k$ if $ k \leq O_q(\sqrt{\log r})$ (up to divisibility issues), and $\leq \binom{r}{k}(q-1)^{r-k}$ distinct columns of…

组合数学 · 数学 2019-03-26 Joseph Briggs , Wesley Pegden
‹ 上一页 1 8 9 10 下一页 ›