中文
相关论文

相关论文: Iterative method of construction of good rhythms

200 篇论文

We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a…

We develop a model of musical rhythm and meter based on optimizing the trade-off between human psychological preferences for perceiving repeated patterns in time with a desire for variety and complexity. By mapping these competing…

统计力学 · 物理学 2026-04-10 Robert St. Clair , Jesse Berezovsky

The present article introduces the notion of quasi-smoothness of marked rhythms through a certain transformation $Ref$, called reformation map. A marked rhythm consists of a rhythm together with a marker, and the map $Ref$ modifies the…

组合数学 · 数学 2022-09-08 Fumio Hazama

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

动力系统 · 数学 2020-05-28 Edgar Matias , Eduardo Silva

A continous map $f: \mathbb{C}^n \rightarrow \mathbb{C}^N$ is $k$-regular if the image of any $k$ points spans a $k$-dimensional subspace. It is an important problem in topology and interpolation theory, going back to Borsuk and Chebyshev,…

代数几何 · 数学 2015-12-03 Mateusz Michałek , Christopher Miller

In this paper, we discuss the associated family of harmonic maps $\mathcal{F}: M \rightarrow G/K$ from a Riemann surface $M$ into inner symmetric spaces of compact or non-compact type which are either algebraic or totally symmetric. These…

微分几何 · 数学 2024-08-23 Josef F. Dorfmeister , Peng Wang

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We…

组合数学 · 数学 2011-05-19 Jerzy W. Jaromczyk , Zbigniew Lonc , Miroslaw Truszczynski

We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…

经典分析与常微分方程 · 数学 2018-02-21 Szyman Draga , Janusz Morawiec

Let K be a ring and let A be a subset of K. We say that a map f:A \to K is arithmetic if it satisfies the following conditions: if 1 \in A then f(1)=1, if a,b \in A and a+b \in A then f(a+b)=f(a)+f(b), if a,b \in A and a \cdot b \in A then…

数论 · 数学 2008-03-01 Apoloniusz Tyszka

Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…

数据结构与算法 · 计算机科学 2017-04-24 Ali Dasdan

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

广义相对论与量子宇宙学 · 物理学 2007-05-23 Sergei A. Klioner

In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erd\"os that measures the minimal gap size $f(k)$ in the sequence of integers at least one of whose prime factors exceeds $k$. This…

数论 · 数学 2011-11-24 Filip Najman

Let $F$ be a strictly $k$-balanced $k$-uniform hypergraph with $e(F)\geq |F|-k+1$ and maximum co-degree at least two. The random greedy $F$-free process constructs a maximal $F$-free hypergraph as follows. Consider a random ordering of the…

组合数学 · 数学 2015-02-03 Daniela Kühn , Deryk Osthus , Amelia Taylor

We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as a hypothesis testing problem, where under the null…

数据结构与算法 · 计算机科学 2022-01-25 Wasim Huleihel

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

组合数学 · 数学 2024-12-20 David Bevan , Dan Threlfall

By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…

几何拓扑 · 数学 2014-09-04 Kouki Taniyama

Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…

泛函分析 · 数学 2022-08-16 Brian Lins

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

组合数学 · 数学 2012-02-08 Martin E. Malandro

We develop a monotone finite volume method for the time fractional Fokker-Planck equations and theoretically prove its unconditional stability. We show that the convergence rate of this method is order 1 in space and if the space grid…

数值分析 · 数学 2017-11-03 Yingjun Jiang , Xuejun Xu
‹ 上一页 1 2 3 10 下一页 ›