相关论文: The Nonassociativity of the Double Minus Operation

Poisson algebra is usually defined to be a commutative algebra together with a Lie bracket, and these operations are required to satisfy the Leibniz rule. We describe Poisson structures in terms of a single bilinear operation. This enables…

Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified through ternary operations. In this context, we introduce structures that contain two constants and a…

We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L'_m$ and $L_n$ are languages of state complexities $m$ and $n$, respectively, and restricted to the same alphabet, the…

We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…

In this paper we continue to investigate the properties of those sequences $\{a_n\}$ satisfying the condition $\sum_{k=0}^n\binom nk(-1)^ka_k=\pm a_n$ $(n\ge 0)$. As applications we deduce new recurrence relations and congruences for…

This paper introduces a class of extended central factorial numbers generated by a parity-dependent recurrence relation, termed the "flickering operator". We demonstrate that the resulting triangular structure, now indexed as OEIS A395021,…

Consider a rooted binary tree with n nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa i the abscissa i-1 (resp. i+1). We prove that the number of binary trees of size n having exactly…

Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…

The OEIS sequence A051221 consists of nonnegative integers of the form 10^x - y^2. The known values are those less than or equal to 2000 with x <= 7, and it is conjectured that no new values in this range appear for x >= 8. In this paper,…

In this paper, necessary and sufficient conditions are established for the factorization of a closed, in general, unbounded operator $T=AB$ into a product of two nonnegative selfadjoint operators $A$ and $B.$ Already the special case, where…

We continue our study of operator algebras with contractive approximate identities (cais). In earlier papers we have introduced and studied a new notion of positivity in operator algebras, with an eye to extending certain $C^*$-algebraic…

Let $(a_n)_{n\ge 1}$ be the greedy self-generating sequence defined by $a_1=1$, $a_2=2$, and, for $k\ge 3$, by taking $a_k$ to be the least integer greater than $a_{k-1}$ that can be written as a sum of at least two consecutive earlier…

We give recurrences, generating functions and explicit exact expressions for the enumeration of fundamental quantities involving runs in binary strings. We first focus on enumerations concerning runs of ones, and we then analyse the same…

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…

Sequence of positive integers $\{x_n\}_{n\geq1}$ is called similar to $\mathbb {N}$ respectively a given property $A$ if for every $n\geq1$ the numbers $x_n$ and $n$ are in the same class of equivalence respectively $A\enskip(x_n\sim n…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. The sequence $\left(f_\mathcal{A}(n)\right)…

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…

Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…