中文
相关论文

相关论文: Counting rises, levels, and drops in compositions

200 篇论文

Building meaningful representations of noun compounds is not trivial since many of them scarcely appear in the corpus. To that end, composition functions approximate the distributional representation of a noun compound by combining its…

计算与语言 · 计算机科学 2019-06-13 Vered Shwartz

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

数论 · 数学 2022-06-13 F. Javier de Vega

Recent work in NLP shows that LSTM language models capture hierarchical structure in language data. In contrast to existing work, we consider the \textit{learning} process that leads to their compositional behavior. For a closer look at how…

计算与语言 · 计算机科学 2020-10-12 Naomi Saphra , Adam Lopez

Carlitz considered integer compositions in which adjacent parts must be unequal. Arndt recently initiated the study of restricted compositions based on conditions applied to certain pairs of parts rather than to individual parts. Here, we…

组合数学 · 数学 2025-12-16 Brian Hopkins , Aram Tangboonduangjit

In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…

数论 · 数学 2018-06-20 Svinin Andrei K

The symplectic blob algebra $b_n$ ($n \in \mathbb{N}$) is a finite dimensional algebra defined by a multiplication rule on a basis of certain diagrams. The rank $r(n)$ of $b_n$ is not known in general, but $r(n)/n$ grows unboundedly with…

表示论 · 数学 2018-08-14 Richard Green , Paul Martin , Alison Parker

We introduce two new classes of integers. The first class consists of numbers $N$ for which there exists at least one nonnegative integer $A$, such that the sum of $A$ and the sum of digits of $N$, added to the reversal of the sum, gives…

数论 · 数学 2019-08-05 Viorel Nitica , Andrei Török

We consider the problem of reconstructing compositions of an integer from their subcompositions, which was raised by Raykova (albeit disguised as a question about layered permutations). We show that every composition w of n\ge 3k+1 can be…

组合数学 · 数学 2007-05-23 Vincent Vatter

While recent generative models can produce engaging music, their utility is limited. The variation in the music is often left to chance, resulting in compositions that lack structure. Pieces extending beyond a minute can become incoherent…

声音 · 计算机科学 2023-11-01 Lilac Atassi

We present an algebraic construction of music notes and show how to associate them inseveral ways to construct music ranges. Then a family of ranges emerge with a fixed number of notes: two, three, five, seven, twelve, seventeen, etc. A…

历史与综述 · 数学 2023-10-09 François Dubois

The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…

组合数学 · 数学 2024-08-21 Walaa Asakly , Noor Kezil

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

组合数学 · 数学 2011-01-27 Chris Dowden

We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…

组合数学 · 数学 2010-11-03 Milan Janjic

Resolvent compositions were recently introduced as monotonicity-preserving operations that combine a set-valued monotone operator and a bounded linear operator. They generalize in particular the notion of a resolvent average. We analyze the…

泛函分析 · 数学 2026-01-30 Diego J. Cornejo

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

组合数学 · 数学 2010-08-30 P. Blasiak

The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and…

数论 · 数学 2011-04-29 Ruslan Sharipov

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

组合数学 · 数学 2020-02-20 Jia Huang

Compositional generalization is the capacity to recognize and imagine a large amount of novel combinations from known components. It is a key in human intelligence, but current neural networks generally lack such ability. This report…

人工智能 · 计算机科学 2021-02-09 Yuanpeng Li

We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic subwords in a…

离散数学 · 计算机科学 2021-08-06 Kalpana Mahalingam , Palak Pandoh

The process of meaning composition, wherein smaller units like morphemes or words combine to form the meaning of phrases and sentences, is essential for human sentence comprehension. Despite extensive neurolinguistic research into the brain…

计算与语言 · 计算机科学 2024-07-11 Changjiang Gao , Jixing Li , Jiajun Chen , Shujian Huang