中文
相关论文

相关论文: Summand minimality and asymptotic convergence of g…

200 篇论文

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

数论 · 数学 2020-06-11 Cristina Ballantine , Mircea Merca

Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

概率论 · 数学 2016-05-17 Iddo Ben-Ari , Steven J. Miller

This paper proposes a universal algorithm for convex minimization problems of the composite form $g_0(x)+h(g_1(x),\dots, g_m(x)) + u(x)$. We allow each $g_j$ to independently range from being nonsmooth Lipschitz to smooth, from convex to…

最优化与控制 · 数学 2026-01-15 Aaron Zoll , Benjamin Grimmer

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach,…

数论 · 数学 2010-08-20 Murat Kologlu , Gene Kopp , Steven J. Miller , Yinghui Wang

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

We show how decreasing diagrams introduced in the theory of rewriting systems can be used to prove coherence type theorems in category theory. We apply this method to describe a coherent presentation of the $0$-Hecke monoid…

范畴论 · 数学 2016-11-11 Ivan Yudin

Let $G$ be a complex reductive group, $\theta \colon G \to G$ an involution, and $K = G^\theta$. In arXiv:1206.5547, W. Schmid and the second named author proposed a program to study unitary representations of the corresponding real form…

表示论 · 数学 2025-09-22 Dougal Davis , Kari Vilonen

We present a theory of reduction of binary quadratic forms with coefficients in Z[lambda], where lambda is the minimal translation in a Hecke group. We generalize from the modular group Gamma(1) = SL(2,Z) to the Hecke groups and make…

数论 · 数学 2007-05-23 Wendell Culp-Ressler

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

组合数学 · 数学 2013-05-01 Haiyan Zhang , Guoqing Wang

Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for…

{\it In Bargmann representation, the reggeon's field theory{\color{blue} [5]} is caracterized by the non symmetrical Gribov operator $\displaystyle{H_{\lambda',\mu,\lambda} = \lambda' A^{*^{2}}A^{2} + \mu A^{*}A + i\lambda A^{*}(A +…

数学物理 · 物理学 2015-01-27 Abdelkader Intissar

Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…

群论 · 数学 2020-11-11 Michael Bate , Benjamin Martin , Gerhard Roehrle

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

组合数学 · 数学 2021-12-03 Jared Bitz , Sarah Griffith , Xiaoyu He

Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…

数值分析 · 数学 2021-06-18 Alexis Goujon , Shayan Aziznejad , Alireza Naderi , Michael Unser

In this paper we introduce a unified analysis of a large family of variants of proximal stochastic gradient descent ({\tt SGD}) which so far have required different intuitions, convergence analyses, have different applications, and which…

最优化与控制 · 数学 2019-05-28 Eduard Gorbunov , Filip Hanzely , Peter Richtárik

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

数论 · 数学 2015-04-01 Francesco Monopoli

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant $s_r(G)$ is the smallest integer $s$ such that every sequence of length $s$ over $G$ has a zero-sum subsequence of…

组合数学 · 数学 2018-11-29 Alexander Sidorenko

Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even…