Related papers: Decimation and Interleaving Operations in One-Side…
Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of…
This paper presents methods for using zonotopes and constrained zonotopes to improve the practicality of a wide variety of set-based operations commonly used in control theory. The proposed methods extend the use of constrained zonotopes to…
In this work we study a linear operator $f$ on a pre-euclidean space $\mathcal{V}$ by using properties of a corresponding graph. Given a basis $\B$ of $\mathcal{V}$, we present a decomposition of $\mathcal{V}$ as an orthogonal direct sum of…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…
Transformer architectures are typically described in algorithmic and statistical terms, leaving their internal mechanics without a familiar structural language for researchers trained in physical theories. To bridge this gap, we develop a…
Let $x$ be a cyclic sequence of $n$ elements of the finite field $\mathbb{F}_q$ (the first element immediately follows the $n$-th one). Let us define the operation $\Delta$ as the transition from $x$ to the sequence of differences of the…
We consider the D1D5 CFT near the orbifold point and develop methods for computing the mixing of untwisted operators to first order by using the OPE on the covering surface. We argue that the OPE on the cover encodes both the structure…
By means of hypercyclic operator theory, we complement our previous results on hypercyclic holomorphic maps between complex Euclidean spaces having slow growth rates,by showing {\it abstract abundance} rather than {\it explicit existence}.…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…
Differentiations of operator algebras over non-archimedean spherically complete fields are investigated. Theorems about a differentiation being internal are demonstrated.
In approximating solutions of nonstationary problems, various approaches are used to compute the solution at a new time level from a number of simpler (sub-)problems. Among these approaches are splitting methods. Standard splitting schemes…
We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…
We consider an algebra with non-standard operations on the class of row monomial matrices (having one unit and rest of zeros in every row). The class of row monomial matrices is closed under multiplication, but not closed under ordinary…
We study the monotone skew-product semiflow generated by a family of neutral functional differential equations with infinite delay and stable D-operator. The stability properties of D allow us to introduce a new order and to take the…
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space $x$ and frequency $\xi$. The symbol smoothness conditions obeyed by many…
In this paper we prove that the classical Lie bracket of vector fields can be generalized to the noncommutative setting by antisymmetrizing (in a suitable noncommutative sense) their compositions. This construction turns out to depend on…
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…
In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…
In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…