Related papers: Symbolic coding for linear trajectories in the reg…
The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the…
We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-10 expansions, Dedekind cuts and continued fractions.
We explicitly compute the limiting gap distribution for slopes of saddle connections on the flat surface associated to the regular octagon with opposite sides identified. This is the first such computation where the Veech group of the…
A binary $[n,k]$-linear code $\mathcal{C}$ is a $k$-dimensional subspace of $\mathbb{F}_2^n$. For $\boldsymbol{x}\in \mathbb{F}_2^n$, the set $\boldsymbol{x}+\mathcal{C}$ is a coset of $\mathcal{C}$. In this work we study a partial ordering…
We present recent evolutions of the detailed opacity code SCO-RCG which combines statistical modelings of levels and lines with fine-structure calculations. The code now includes the Partially-Resolved-Transition-Array model, which allows…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
This paper is devoted to a detailed exposition of geometry of continued fractions. We pay particular interest to the case of quadratic irrationalities and use the technique described to prove a criterion for the continued fraction of a…
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…
A new kind of cut diagram is introduced to sum Feynman diagrams with nonabelian vertices. Unlike the Cutkosky diagrams which compute the discontinuity of single Feynman diagrams, the nonabelian cut diagrams represent a resummation of both…
We present a data-driven framework to automate the vectorization and machine interpretation of 2D engineering part drawings. In industrial settings, most manufacturing engineers still rely on manual reads to identify the topological and…
This paper proposes an algorithm for clipping line segment against an axis-aligned rectangular window. The conventional algorithms for line segment clipping treat the clipping boundary and/or the line segment to be clipped as line. The…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…
We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…
We consider symbolic flows over finite alphabets and study certain kinds of repetitions in these sequences. Positive and negative results for the existence of such repetitions are given for codings of interval exchange transformations and…
Spherical contours introduced in \cite{SphericalContours} translate the concept of "discontinuity across a branch cut" to Feynman parameter space. In this paper, we further explore spherical contours and connect them to the computation of…
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…