中文
相关论文

相关论文: Some integer sequences based on derangements

200 篇论文

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

计算机科学中的逻辑 · 计算机科学 2023-02-10 Martin Svatoš , Peter Jung , Jan Tóth , Yuyi Wang , Ondřej Kuželka

We will derive a function that eliminates any sequence of equidistant numbers from the integer numbers, then we will derive its inverse. Then we will use the Sequence elimination function to eliminate the multiples of the prime numbers from…

数论 · 数学 2021-02-25 Ahmed Diab

There are several standard procedures used to create new sequences from a given sequence or from a given pair of sequences. In this paper I discuss the most popular of these procedures. For each procedure, I give a definition and provide…

组合数学 · 数学 2007-12-17 Tanya Khovanova

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

数论 · 数学 2016-02-08 Tigran Hakobyan

We use the concept of the half of a lower-triangular matrix to define a transformation on integer sequences. We explore the properties of this transformation, including in some cases a study of the Hankel transform of the transformed…

组合数学 · 数学 2020-04-10 Paul Barry

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

综合数学 · 数学 2021-08-23 Ryoji Fukuda

Introduction to the theory of decoherence. Contents: 1. The phenomenon of decoherence: superpositions, superselection rules, decoherence by "measurements". 2. Observables as a derivable concept. 3. The measurement problem. 4. Density…

量子物理 · 物理学 2008-02-03 H. D. Zeh

Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…

信息论 · 计算机科学 2007-07-13 Gil I. Shamir

Numbers are a basic part of how humans represent and describe the world around them. As a consequence, learning effective representations of numbers is critical for the success of large language models as they become more integrated into…

计算与语言 · 计算机科学 2025-02-04 Raja Marjieh , Veniamin Veselovsky , Thomas L. Griffiths , Ilia Sucholutsky

Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…

经典分析与常微分方程 · 数学 2025-11-17 Alex Kasman , Robert Milson

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

计算机科学中的逻辑 · 计算机科学 2012-04-16 Mnacho Echenim , Nicolas Peltier

Descents of odd length in Dyck paths are discussed, taking care of some variations. The approach is based on generating functions and the kernel method and augments relations about them from the Encyclopedia of Integer Sequences, that were…

组合数学 · 数学 2024-08-05 Helmut Prodinger

We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…

经典分析与常微分方程 · 数学 2011-04-26 Roland Groux

We define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…

组合数学 · 数学 2021-05-14 László Németh , László Szalay

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

数论 · 数学 2025-01-10 Dan Ismailescu , Yunkyu James Lee

Embedding words in high-dimensional vector spaces has proven valuable in many natural language applications. In this work, we investigate whether similarly-trained embeddings of integers can capture concepts that are useful for mathematical…

计算与语言 · 计算机科学 2021-09-16 Maria Ryskina , Kevin Knight

The results of difference sequences theory are applied to analytic function theory and Diophantine equations. As a result we have the equation which connects the $n$-th derivative of a function with the difference sequence for the values of…

综合数学 · 数学 2014-01-15 Georgii Khantarzhiev

A family of sequences produced by a non-homogeneous linear recurrence formula derived from the geometry of circles inscribed in lenses is introduced and studied. Mysterious ``underground'' sequences underlying them are discovered in this…

数论 · 数学 2007-10-18 Jerzy Kocik

We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…

组合数学 · 数学 2019-05-14 Milan Janjic

Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the…

人工智能 · 计算机科学 2025-05-20 Christian Antić