中文
相关论文

相关论文: A Reciprocity Theorem for Monomer-Dimer Coverings

200 篇论文

We consider polymers in which M randomly selected pairs of monomers are restricted to be in contact. Analytical arguments and numerical simulations show that an ideal (Gaussian) chain of N monomers remains expanded as long as M<<N; its mean…

凝聚态物理 · 物理学 2009-10-28 Yacov Kantor , Mehran Kardar

The following theorem is proved: Suppose $M = (a_{i,j})$ be a $k \times k$ matrix with positive entries and $a_{i,j}a_{i+1,j+1} > 4\cos ^2 \frac{\pi}{k+1} a_{i,j+1}a_{i+1,j} \quad (1 \leq i \leq k-1, 1 \leq j \leq k-1).$ Then $\det M > 0 .$…

环与代数 · 数学 2007-05-23 Olga M. Katkova , Anna M. Vishnyakova

The generalized Narayana polynomials $N_{n,m}(x)$ arose from the study of infinite log-concavity of the Boros-Moll polynomials. The real-rootedness of $N_{n,m}(x)$ had been proved by Chen, Yang and Zhang. They also showed that when $n\geq…

组合数学 · 数学 2021-08-10 James J. Y. Zhao

We deal with the problem of description of nonsingular pairs of compatible flat metrics for the general $N$-component case. We describe the scheme of the integrating the nonlinear equations describing nonsingular pairs of compatible flat…

微分几何 · 数学 2007-05-23 O. I. Mokhov

A family of nested recurrence relations $a(n+1) = n - a^{(m)}(n) + a^{(m+1)}(n)$, parameterized by an integer $m \ge 1$ with initial condition $a(1)=1$, is studied. We prove that $a(n)=n-h(n)$ is the unique solution satisfying this…

组合数学 · 数学 2025-06-03 Benoit Cloitre

In the Stanley lattice defined on Dyck paths of size $n$, cover relations are obtained by replacing a valley $DU$ by a peak $UD$. We investigate a greedy version of this lattice, first introduced by Chenevi\`ere, where cover relations…

组合数学 · 数学 2025-05-28 Jean-Luc Baril , Mireille Bousquet-Mélou , Sergey Kirgizov , Mehdi Naima

We show that for $m, r \in \mathbb{N}$ and $N > (2m+1)^r (r!)^{1/m}$, every $r$-coloring of the integers in the interval $[N]$ contains a monochromatic solution to the equation \[ x_1 + \dots + \dots x_{m+1} = y_1 + \dots + y_m. \] This…

组合数学 · 数学 2026-05-15 Rafael Miyazaki , Eion Mulrenin , Cosmin Pohoata , Michael Zheng

For $p, q\in \mathbb{N}$, a finite nonempty set $F$ is said to be $(p,q)$-Schreier (or maximal $(p,q)$-Schreier, respectively) if $q\min F\ge p|F|$ (or $q\min F = p|F|$, respectively). For $n\in \mathbb{N}$, let $$\mathcal{S}^{p/q}_{n}\ :=\…

组合数学 · 数学 2026-02-17 Hung Viet Chu , Zachary Louis Vasseur

Let $\mathscr{P}_{m}$ be the graph on the set of perfect matchings in the complete graph $K_{2m}$, where two perfect matchings are connected by an edge if their symmetric difference is a cycle of length four. This paper studies geodesics in…

组合数学 · 数学 2020-06-30 Roy H. Jennings

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

数论 · 数学 2017-10-13 Błażej Żmija

Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…

形式语言与自动机理论 · 计算机科学 2021-01-18 Ismaël Jecker

Given the collection of all $m\times n$ rectangular grids which have a fixed number $1\leq r\leq mn$ of blocked cells, we explicitly describe a proper subset of the collection which is guaranteed to contain at least one grid from each…

组合数学 · 数学 2025-11-27 Noah Jensen , Stephanie Treneer

The finite Young lattice $L(m, n)$ is rank-symmetric, rank-unimodal, and has the strong Sperner property. R. Stanley further conjectured that $L(m, n)$ admits a symmetric chain order. We show that the order structure on $L(m, n)$ is…

组合数学 · 数学 2024-07-30 Terrance Coggins , Robert W. Donley , Ammara Gondal , Arnav Krishna

Let $n,m$ be positive integers and $c \in \mathbb{Z}_n$, where $\mathbb{Z}_n$ is the ring of integers modulo $n$. We almost complete providing the answer to the following problem, partially solved by N. Alon. Does any infinite sequence over…

数论 · 数学 2025-11-12 Arie Bialostocki , Vladyslav Oles

We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…

组合数学 · 数学 2013-12-20 Felix Fontein , Pawel Wocjan

The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…

逻辑 · 数学 2011-09-23 Márton Elekes

Fix a prime $p >2$ and a finite field $\mathbb{F}_{q}$ with $q$ elements, where $q$ is a power of $p$. Let $m$ be a monic polynomial in the polynomial ring $\mathbb{F}_{q}[T]$ such that $deg(m)$ is large. Fix an integer $r\geq 2$, and let…

数论 · 数学 2021-10-15 Youssef Sedrati

For every nonconstant monic polynomial $g \in \mathbb{Z}[X]$, let $\mathfrak{M}(g)$ be the set of positive integers $m$ for which there exist an integer linear recurrence $(s_n)_{n \geq 0}$ having characteristic polynomial $g$ and a…

数论 · 数学 2021-09-14 Carlo Sanna

We consider tiles (dimers) each of which covers two vertices of a rectangular lattice. There is a normalized translation invariant weighting on the shape of the tiles. We study the pressure, p, or entropy, (one over the volume times the…

数学物理 · 物理学 2010-03-03 Paul Federbush

Erd\H{o}s and Graham posed the question of whether there exists an integer $n$ such that the divisors of $n$ greater than $1$ form a distinct covering system with pairwise coprime moduli for overlapping congruences. Adenwalla recently…

数论 · 数学 2025-04-28 Zhengkun Jia , Huixi Li , Yushuo Liu
‹ 上一页 1 8 9 10 下一页 ›