中文
相关论文

相关论文: Counting set systems by weight

200 篇论文

We consider systems $\vec{F}(\vec{x})$ of $R$ homogeneous forms of the same degree $d$ in $n$ variables with integral coefficients. If $n\geq d2^dR+R$ and the coefficients of $\vec{F}$ lie in an explicit Zariski open set, we give a…

数论 · 数学 2017-10-25 Simon L. Rydin Myerson

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$.The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

组合数学 · 数学 2021-07-23 Saeid Alikhani , Maryam Safazadeh

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

组合数学 · 数学 2023-01-31 Marcelo Campos , Matthew Coulson , Oriol Serra , Maximilian Wötzel

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…

组合数学 · 数学 2013-05-14 Alexander Barvinok

For a graph $F$, we say a hypergraph is a Berge-$F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is a Berge-$F$. The…

组合数学 · 数学 2019-03-14 Sean English , Dániel Gerbner , Abhishek Methuku , Cory Palmer

Let M be a complete Riemannian manifold with negative curvature, and let C_-, C_+ be two properly immersed closed convex subsets of M. We survey the asymptotic behaviour of the number of common perpendiculars of length at most s from C_- to…

动力系统 · 数学 2013-05-09 Jouni Parkkonen , Frédéric Paulin

In this paper we give a different approach to determining the cardinality of $h$-fold sumsets $hA$ when $A\subset \mathbb{Z}^d$ has $d+2$ elements. This enables us to provide more general result with a shorter and simpler proof. We also…

数论 · 数学 2022-11-10 Ilija Vrećica

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

组合数学 · 数学 2007-05-23 E. Rodney Canfield , Catherine Greenhill , Brendan D. McKay

We investigate the global density of zeros of generalized Hermite orthogonal polynomials, subject to certain truncated conditions on its weight. We shall given explicitly the global density of zeros under some asymptotic conditions on the…

概率论 · 数学 2014-11-26 Mohamed Bouali

It is known that the ordered Bell numbers count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of $[n]$. We first study…

综合数学 · 数学 2021-02-02 Hacéne Belbachir , Yahia Djemmada , László Németh

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

组合数学 · 数学 2024-03-07 Shanshan Du , Hao Pan

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

数论 · 数学 2026-05-28 Melvyn B. Nathanson

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

数论 · 数学 2019-05-21 Pierre-Yves Bienvenu , François Hennecart

By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…

组合数学 · 数学 2013-10-24 Yury Kochetkov

We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…

数学物理 · 物理学 2025-08-12 Valentin Vengerovsky

Let $\alpha=\{a_1,a_2,a_3,...,a_n\}$ be a set of elements, $\delta < n$ be a non-negative integer, and $\Gamma: \alpha \to \{0, 1, 2, ..., n\}$ be a total mapping. Then, we call $\Gamma$ a \emph{partition} of $\alpha$ if and only if for all…

数据结构与算法 · 计算机科学 2021-02-04 Samer Nofal

A set $A$ of nonnegative integers is an asymptotic basis of order $h$ if every sufficiently large integer can be represented as the sum of $h$ integers (not necessarily distinct) of $A$. An asymptotic basis $A$ of order $h$ is minimal if no…

数论 · 数学 2022-01-27 Yong-Gao Chen , Min Tang

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

度量几何 · 数学 2025-04-25 Srinivas Arun , Travis Dillon

A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined,…

逻辑 · 数学 2015-11-09 James H. Schmerl