中文
相关论文

相关论文: Existence of symmetric maximal noncrossing collect…

200 篇论文

Let J and J* be subsets of Z+ such that 0,1\in J and 0\in J*. For infinitely many n, let k=(k_1,..., k_n) be a vector of nonnegative integers whose sum M is even. We find an asymptotic expression for the number of multigraphs on the vertex…

组合数学 · 数学 2013-09-24 Catherine Greenhill , Brendan D McKay

Let $P_1,P_2,\dots, P_k$ be complex polynomials of degree at least two that are not simultaneously conjugate to monomials or to Chebyshev polynomials, and $S$ the semigroup under composition generated by $P_1,P_2,\dots, P_k$. We show that…

动力系统 · 数学 2020-11-19 Fedor Pakovich

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

群论 · 数学 2022-06-24 Francesco Fumagalli , Martino Garonzi , Pietro Gheri

Let $n$ be a fixed integer with $n\geq 2$. For $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a cycle. So $||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$. For…

组合数学 · 数学 2022-12-19 Simon R. Blackburn

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all its $k$-subsets. Two families of sets $\mathcal A$ and $\mathcal B$ are called cross-intersecting if $A\cap B \neq \emptyset$ holds for all $A\in\mathcal A$,…

组合数学 · 数学 2019-05-21 Peter Frankl , Andrey Kupavskii

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

组合数学 · 数学 2024-01-03 Ehab Ebrahem , Shlomo Hoory , Dani Kotlar

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

表示论 · 数学 2026-03-05 Shantanu Sardar

Let $k \geq 1$ be an integer. A set $A \subset \mathbb{Z}$ is a $k$-fold Sidon set if $A$ has only trivial solutions to each equation of the form $c_1 x_1 + c_2 x_2 + c_3 x_3 + c_4 x_4 = 0$ where $0 \leq |c_i | \leq k$, and $c_1 + c_2 + c_3…

组合数学 · 数学 2013-12-18 Javier Cilleruelo , Craig Timmons

Let $q$ be an odd prime and $k$ be a natural number. We show that a finite subset of integers $S$ that does not contain any perfect $q^{th}$ power, contains a $q^{th}$ power residue modulo almost every natural numbers $N$ with at most $k$…

数论 · 数学 2025-07-17 Bhawesh Mishra , Paolo Santonastaso

A subset $A$ of a given finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ does not equal the sum of $l$ (not necessarily distinct) elements of $A$. We are interested in finding…

组合数学 · 数学 2008-04-01 Bela Bajnok

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

数论 · 数学 2010-10-11 Matthew L. Smith

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

组合数学 · 数学 2020-05-13 G. Longobardi , G. Lunardon , R. Trombetti , Y. Zhou

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

组合数学 · 数学 2022-10-28 Cheryl E. Praeger , Enoch Suleiman

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…

组合数学 · 数学 2012-10-29 Hein van der Holst

Let $(\mathfrak{g},\mathfrak{k})$ be a supersymmetric pair arising from a finite-dimensional, symmetrizable Kac-Moody superalgebra $\mathfrak{g}$. An important branching problem is to determine the finite-dimensional highest-weight…

表示论 · 数学 2025-04-28 Alexander Sherman

A subset $A$ of a finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not-necessarily-distinct) elements of $A$ never equals the sum of $l$ (not-necessarily-distinct) elements of $A$. We find an explicit formula for the…

数论 · 数学 2018-09-07 Béla Bajnok , Ryan Matzke

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

组合数学 · 数学 2025-07-22 Michael A. Allen

In [12] was introduced, for cyclic groups, the class of partially filled arrays of the non-zero sum Heffter array that are, as the Heffter arrays, related to difference families, graph decompositions, and biembeddings. Here we generalize…

组合数学 · 数学 2022-09-07 Simone Costa , Stefano Della Fiore

We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing…

统计理论 · 数学 2026-05-18 Hien Duy Nguyen

We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval…

组合数学 · 数学 2020-10-12 Aliaksei Semchankau