中文
相关论文

相关论文: Middle divisors and $\sigma$-palindromic Dyck word…

200 篇论文

Valid hook configurations are combinatorial objects used to understand West's stack sorting map as well as cumulants in noncommutative probability theory. We show a bijection between reduced valid hook configurations on 312-avoiding…

组合数学 · 数学 2020-10-23 Ilani Axelrod-Freed

For any real number $s$, let $\sigma_s$ be the generalized divisor function, i.e., the arithmetic function defined by $\sigma_s(n) := \sum_{d \, \mid \, n} d^s$, for all positive integers $n$. We prove that for any $r > 1$ the topological…

数论 · 数学 2018-03-13 Carlo Sanna

We prove that for every integer $d \ge 2$ there exists a dense collection of subsets of $[n]^d$ such that no two of them have a symmetric difference that may be written as the $d$th power of a union of at most $\lfloor d/2 \rfloor$…

组合数学 · 数学 2024-08-28 Thomas Karam

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…

组合数学 · 数学 2026-03-03 Sergey Kitaev , Dun Qiu

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

数论 · 数学 2025-04-25 Jean-Paul Allouche , Manon Stipulanti , Jia-Yan Yao

Let $\iota_{k}(m,l)$ denote the total number of intervals of length $m$ across all Dyck paths of semilength $k$ such that each interval contains precisely $l$ falls. We give the formula for $\iota_{k}(m,l)$ and show that…

组合数学 · 数学 2025-01-28 Jan Petr , Pavel Turek

We prove the following version of the Campana's orbifold conjecture: Let $X$ be a complex non-singular projective variety of dimension $n$. Let $D_1,\ldots,D_{n+1}$ be $\mathbb Z$-linearly independent effective divisors in ${\rm Div}(X)$…

复变函数 · 数学 2025-06-03 Min Ru , Julie Tzu-Yueh Wang

We show that the expected asymptotic for the sums $\sum_{X < n \leq 2X} \Lambda(n) \Lambda(n+h)$, $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$, and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$ hold for almost all $h \in [-H,H]$, provided that…

数论 · 数学 2019-02-19 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

Consider the $2n$-by-$2n$ matrix $M=(m_{i,j})_{i,j=1}^{2n}$ with $m_{i,j} = 1$ for $i,j$ satisfying $|2i-2n-1|+|2j-2n-1| \leq 2n$ and $m_{i,j} = 0$ for all other $i,j$, consisting of a central diamond of 1's surrounded by 0's. When $n \geq…

组合数学 · 数学 2007-05-23 James Propp

We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Thomas Place

A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…

组合数学 · 数学 2022-09-13 Josef Rukavicka

Let $\mathbf{X}^{(1)}_{n},\ldots,\mathbf{X}^{(m)}_{n}$, where $\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\ldots,X^{(i)}_{n})$, $i=1,\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their…

概率论 · 数学 2016-03-15 Ruoting Gong , Christian Houdré , Ümit Işlak

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…

离散数学 · 计算机科学 2015-10-08 Pascal Ochem

This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…

动力系统 · 数学 2017-12-01 A. Ya. Belov , G. V. Kondakov , I. Mitrofanov

A binary word is Sturmian if the occurrences of each letter are balanced, in the sense that in any two factors of the same length, the difference between the number of occurrences of the same letter is at most 1. In digital geometry,…

离散数学 · 计算机科学 2025-11-11 Alessandro De Luca , Gabriele Fici

Given a pseudo-effective divisor L we construct the diminished ideal of L, a "continuous" extension of the asymptotic multiplier ideal for big divisors to the pseudo-effective boundary. For most pseudo-effective divisors L the multiplier…

代数几何 · 数学 2013-06-13 Brian Lehmann

In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.

综合数学 · 数学 2011-09-13 Hisanobu Shinya

We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…

数论 · 数学 2026-01-21 Madhuparna Das , Nicolas Robles

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

数论 · 数学 2007-08-17 Anthony Flatters

We say that a weighted shift $W_\alpha$ with (positive) weight sequence $\alpha: \alpha_0, \alpha_1, \ldots$ is {\it moment infinitely divisible} (MID) if, for every $t > 0$, the shift with weight sequence $\alpha^t: \alpha_0^t, \alpha_1^t,…

泛函分析 · 数学 2019-10-22 Chafiq Benhida , Raul E. Curto , George R. Exner