中文
相关论文

相关论文: Decomposing sequences into monotonic subsequences

200 篇论文

The reason why Cooley-Tukey Fast Fourier Transform (FFT) over $\mathbb{Q}$ can be efficiently implemented using complex roots of unity is that the cyclotomic extensions of the completion $\mathbb{R}$ of $\mathbb{Q}$ are at most quadratic,…

符号计算 · 计算机科学 2025-05-06 Hiromasa Kondo

We obtain sharp bounds for the monotonic rearrangement operator from "dyadic-type" classes to "continuous". In particular, for the $\mathrm{BMO}$ space and Muckenhoupt classes. The idea is to connect the problem with a simple geometric…

经典分析与常微分方程 · 数学 2016-04-07 Dmitriy M. Stolyarov , Vasily I. Vasyunin , Pavel B. Zatitskiy

We show that for the problem of minimizing (or maximizing) the ratio of two supermodular functions, no bounded approximation ratio can be achieved via polynomial number of queries, if the two supermodular functions are both monotone…

机器学习 · 计算机科学 2020-12-18 Wenxin Li

We present a natural extension of Andrews' multiple sums counting partitions with difference 2 at distance $k-1$, by deriving the generating function for $K$-restricted jagged partitions. A jagged partition is a collection of non-negative…

数学物理 · 物理学 2007-05-23 J. -F. Fortin , P. Jacob , P. Mathieu

For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…

形式语言与自动机理论 · 计算机科学 2022-05-30 Didier Caucal , Chloé Rispal

It is known that all $k$-homogeneous orthogonally additive polynomials $P$ over $C(K)$ are of the form $$ P(x)=\int_K x^k d\mu . $$ Thus $x\mapsto x^k$ factors all orthogonally additive polynomials through some linear form $\mu$. We show…

泛函分析 · 数学 2011-01-13 Daniel Carando , Silvia Lassalle , Ignacio Zalduendo

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

经典分析与常微分方程 · 数学 2007-05-25 Bálint Farkas , Viktor Harangi , Tamás Keleti , Szilárd Gy. Révész

Given positive integers $n$ and $k$, a $k$-term semi-progression of scope $m$ is a sequence $(x_1,x_2,...,x_k)$ such that $x_{j+1} - x_j \in \{d,2d,\ldots,md\}, 1 \le j \le k-1$, for some positive integer $d$. Thus an arithmetic progression…

组合数学 · 数学 2014-01-14 Mano Vikash Janardhanan , Sujith Vijay

This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are…

数论 · 数学 2007-05-23 Greg Martin

Let U be the open unit disc in C. Given a continuous function g: bU --> C-{0} denote by W(g) the winding number of g around the origin. We prove that a continuous function f: bU --> C extends meromorphically through U if and only if there…

复变函数 · 数学 2007-05-23 Josip Globevnik

Let $n \in \N$ and $M_n$ be the algebra of $n \times n$ matrices. We call a function $f$ matrix monotone of order $n$ or $n$-monotone in short whenever the inequality $f(a) \leq f(b)$ holds for every pair of selfadjoint matrices $a, b \in…

算子代数 · 数学 2008-05-15 Hiroyuki Osaka , Jun Tomiyama

A $k$-Markov number is a positive integer that appears in a positive integral solution to the Diophantine equation $x^2 + y^2 + z^2 + k(xy + xz + yz) = (3+3k)xyz$. This equation was introduced by Gyoda and Matsushita. When $k =0$, this…

数论 · 数学 2026-04-21 Esther Banaian , Min Huang

We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…

组合数学 · 数学 2023-05-25 Rishi Sonthalia , Anna Seigal , Guido Montufar

In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of $k$ items from a ground set $V$ such that the weighted…

机器学习 · 计算机科学 2023-12-13 Shaojie Tang , Jing Yuan

A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…

最优化与控制 · 数学 2018-10-16 Marc Lassonde

We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…

概率论 · 数学 2012-01-17 Itai Benjamini , Ori Gurel-Gurevich , Ron Peled

Let X be a connected open set in n-dimensional Euclidean space, partially ordered by a closed convex cone K with nonempty interior: y > x if and only if y-x is nonzero and in K. Theorem: If F is a monotone local flow in X whose periodic…

动力系统 · 数学 2018-06-27 Morris W. Hirsch

We prove that $1-o(1)$ fraction of all $k$-SAT functions on $n$ Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer $k$ and as $n \to \infty$. This resolves a conjecture by…

组合数学 · 数学 2023-10-04 József Balogh , Dingding Dong , Bernard Lidický , Nitya Mani , Yufei Zhao

We show analytically that Newtonian iterations, when applied to a polynomial equation, have a positive topological entropy. In a specific example of an attempt to ``find'' the real solutions of the equation $x^2+1=0$, we show that the…

混沌动力学 · 物理学 2011-01-24 Lukasz Skowronek , P. F. Gora

Motivated by a problem on comonotone approximation of $C^n$ functions by entire functions, for increasing functions $f\colon[0,1]\to[0,1]$, we characterize the possible values of $(a,b,c)$, where $a=I(f)(1)$, $b=I^2(f)(1)$, $c=I^3(f)(1)$…

经典分析与常微分方程 · 数学 2025-12-03 Maxim R. Burke , Maleeha Haris , Madhavendra