中文
相关论文

相关论文: A generalization of Sch\"{o}nemann's theorem via a…

200 篇论文

P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…

组合数学 · 数学 2016-10-10 Gabor Hegedüs , Lajos Ronyai

In this paper we first establish the theory of a magnetic Sobolev space $H^1_A(\mathcal{G},\mathbb{C})$ on metric graphs $\mathcal{G}$ and we prove the self-adjointness of its corresponding magnetic Schr\"odinger operator. Then, in this…

偏微分方程分析 · 数学 2025-12-30 Pietro d'Avenia , Zhentao He , Chao Ji

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

数论 · 数学 2026-05-22 Wujie Shi

Let $p_1,p_2,\dots,p_n, a_1,a_2,\dots,a_n \in \N$, $x_1,x_2,\dots,x_n \in \R$, and denote the $k$th periodized Bernoulli polynomial by $\B_k(x)$. We study expressions of the form \[ \sum_{h \bmod{a_k}} \ \prod_{\substack{i=1\\ i\not=k}}^{n}…

数论 · 数学 2013-10-07 Matthias Beck , Anastasia Chavez

We are concerned with the nonlinear Schr\"odinger equation with an $L^2$ mass constraint on both finite and locally finite graphs and prove that the equation has a normalized solution by employing variational methods. We also pay attention…

偏微分方程分析 · 数学 2023-02-27 Yunyan Yang , Liang Zhao

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

数论 · 数学 2019-12-09 M. E. Changa , M. A. Korolev

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

组合数学 · 数学 2019-10-30 Gaiane Panina

It is conjectured by Chen and Raspaud that for each integer $k \ge 2$, any graph $G$ with \[ \mathrm{mad}(G) < \frac{2k+1}{k} \quad\text{and}\quad \mathrm{odd\text{-}girth}(G) \ge 2k+1 \] admits a homomorphism into the Kneser graph…

组合数学 · 数学 2024-12-25 Michał Fiedorowicz

Shnirel'man's inequality and Shnirel'man's basis theorem are fundamental results about sums of sets of positive integers in additive number theory. It is proved that these results are inherently order-theoretic and extend to partially…

数论 · 数学 2025-05-02 Melvyn B. Nathanson

We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values…

数论 · 数学 2012-05-16 John C. Harris , David L. wehlau

In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's…

组合数学 · 数学 2025-02-14 Xiongfeng Zhan , Xueyi Huang

In this paper we combine methods from additive combinatorics and Diophantine geometry to study the generalised sum-product phenomenon in algebraic groups. As an application of this circle of ideas, we resolve a conjecture of Bremner on…

数论 · 数学 2026-03-09 Joseph Harrison , Akshat Mudgal , Harry Schmidt

The Heilmann--Lieb theorem is a fundamental theorem in algebraic combinatorics which provides a characterization of the distribution of the zeros of matching polynomials of graphs. In this paper, we establish a hypergraph Heilmann--Lieb…

组合数学 · 数学 2025-04-01 Jiang-Chao Wan , Yi Wang , Yi-zheng Fan

In this paper we study a mixed problem for the nonlinear Schr\"odinger equation globally that have a nonlinear adding, in which the coefficient is a generalized function. Here is proved a global solvability theorem of the considered problem…

数学物理 · 物理学 2012-11-16 Kamal N. Soltanov

Applying Baaz's Generalization Method and a new technique to, respectively, proofs and denumerable simple graphs, diverse arithmetical patterns are observed. In particular, sufficient conditions for a number to be a divisor of a Fermat…

数论 · 数学 2020-02-11 Lorenzo Sauras-Altuzarra

In this paper we completely resolve the well-known problem of Erd\H{o}s and Sauer from 1975 which asks for the maximum number of edges an $n$-vertex graph can have without containing a $k$-regular subgraph, for some fixed integer $k\geq 3$.…

组合数学 · 数学 2022-08-16 Oliver Janzer , Benny Sudakov

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

综合数学 · 数学 2026-01-23 Edwige Tolla

We carry out the complete group classification of the class of (1+1)-dimensional linear Schr\"odinger equations with complex-valued potentials. After introducing the notion of uniformly semi-normalized classes of differential equations, we…

数学物理 · 物理学 2018-03-07 Célestin Kurujyibwami , Peter Basarab-Horwath , Roman O. Popovych

In this paper, we investigate the combinatorial structure and asymptotic distribution of the solution set of the equation $\sigma(n+1) = k\sigma(n)$ for a given integer $k>1$. From a combinatorial perspective, the solutions to this equation…

数论 · 数学 2026-05-22 Amirali Fatehizadeh

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

组合数学 · 数学 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger