Related papers: Using alternating de Bruijn sequences to construct…
By the SYZ construction, a mirror pair $(X,\check{X})$ of a complex torus $X$ and a mirror partner $\check{X}$ of the complex torus $X$ is described as the special Lagrangian torus fibrations $X \rightarrow B$ and $\check{X} \rightarrow B$…
We study an interesting family of cooperating coroutines, which is able to generate all patterns of bits that satisfy certain fairly general ordering constraints, changing only one bit at a time. (More precisely, the directed graph of…
In this paper, we study non-planar degeneracies with cylindrical configurations. They could be constructed by the product $\mathbb{CP}^1 \times T$ of the projective plane and a complex torus with embedding $(m,n)$. We prove that their…
Generative models reliant on sequential autoregression have been at the forefront of language generation for an extensive period, particularly following the introduction of widely acclaimed transformers. Despite its excellent performance,…
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
We derive an efficient way to obtain generating functions of bipartite maps of arbitrary genus and boundary length using a spectral curve as initial data for the framework of topological recursion. Based on an earlier result of Chapuy and…
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial $f(x)=p(x)q(x)$ where $p(x)$ and $q(x)$ are distinct irreducible polynomials in $\F_2[x]$. Important properties of the LFSRs, such as the cycle…
In recent papers, summarized in survey [1], we construct a number of examples of non standard lagrangian tori on compact toric varieties and as well on certain non toric varieties which admit pseudotoric structures. Using this pseudotoric…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
Let $K= K(w,b,t)$ be a 1-bridge braid in a solid torus $V$, and let $\gamma$ be a $(p,q)$ curve on the torus $T = \partial V$ of the exterior $M_K$ of $K$. It will be shown that Dehn filling on $T$ along $\gamma$ produces a solid torus if…
We describe how traceless projection of tensors of a given rank can be constructed in a closed form. On the way to this goal we invoke the representation theory of the Brauer algebra and the related Schur-Weyl dualities. The resulting…
We prove the 2-torus $\mathbb T$, an abelian linear algebraic group, is a fine moduli space of labeled, oriented, possibly-degenerate inscribable similarity classes of triangles, where a triangle is {\it inscribable} if it can be inscribed…
We explicitly construct a pair of immersed tori in three dimensional Euclidean space that are related by a mean curvature preserving isometry. These Bonnet pair tori are the first examples of compact Bonnet pairs. This resolves a…
We introduce a particular family of two-dimensional surfaces in $\mathbb R^4$ which generalize the classical Dini surfaces in $\mathbb R^3$.
We will use overlays and templates derived from two-dimensional recurrence relations to build the arrays, and we will study the structure of the overlays, including initial conditions and basis arrays.
Recently, deep architectures, such as recurrent and recursive neural networks have been successfully applied to various natural language processing tasks. Inspired by bidirectional recurrent neural networks which use representations that…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
We consider a class of quasi-integrable Hamiltonian systems obtained by adding to a non-convex Hamiltonian function of an integrable system a perturbation depending only on the angle variables. We focus on a resonant maximal torus of the…