Related papers: Range Algebra for Safe Array Splits

We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…

Let $(A, \|\cdot\|)$ be any normed algebra (not necessarily complete nor unital). Let $a \in A$ and let $V_A(a)$ denote the spatial numerical range of $a$ in $(A, \|\cdot\|)$. Let $A_e = A + {\mathbb C} 1$ be the unitization of $A$. If $A$…

We classify extremal traces on the seven direct limit algebras of noncrossing partitions arising from the classification of free partition quantum groups of Banica-Speicher (arXiv:0808.2628) and Weber (arXiv:1201.4723). For the…

We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential…

We study splittings, or lack of them, in lattices of subvarieties of some logic-related varieties. We present a general lemma, the Non-Splitting Lemma, which when combined with some variety-specific constructions, yields each of our…

We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired…

We use algebraic geometry to study the anomaly-free representations of an arbitrary gauge Lie algebra for 4-dimensional spacetime fermions. For irreducible representations, the problem reduces to studying the Lie algebras $\mathfrak{su}_n$…

This paper presents segmentation-free strategies for the recognition of handwritten numeral strings of unknown length. A synthetic dataset of touching numeral strings of sizes 2-, 3- and 4-digits was created to train end-to-end solutions…

Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form $S:=\{x : \pi_0 \leq \pi^T x \leq \pi_0+1 \}$ called split sets. The set obtained by adding all split…

In this paper, we consider the problem of noiseless non-adaptive group testing under the for-each recovery guarantee, also known as probabilistic group testing. In the case of $n$ items and $k$ defectives, we provide an algorithm attaining…

We introduce a notion of genus range as a set of values of genera over all surfaces into which a graph is embedded cellularly, and we study the genus ranges of a special family of four-regular graphs with rigid vertices that has been used…

We show how, given a straight-line program with $g$ rules for a binary string $B$ of length $n$, in $O(g^{2 / 3} n^{4 / 3})$ time we can build a linear-space index such that, given $m$ and $c$, in O(1) time we can determine whether there is…

The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…

We determine fundamental systems of invariants for complex solvable rigid Lie algebras having nonsplit nilradicals of characteristic sequence $(3,1,..,1)$, these algebras being the natural followers of solvable algebras having Heisenberg…

Given a set $S$ of $n$ points in the plane, we consider the problem of answering range selection queries on $S$: that is, given an arbitrary $x$-range $Q$ and an integer $k > 0$, return the $k$-th smallest $y$-coordinate from the set of…

Bille and G{\o}rtz (2011) recently introduced the problem of substring range counting, for which we are asked to store compactly a string $S$ of $n$ characters with integer labels in ([0, u]), such that later, given an interval ([a, b]) and…

Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri…

Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…

In this paper we introduce a method to detect words or phrases in a given sequence of alphabets without knowing the lexicon. Our linear time unsupervised algorithm relies entirely on statistical relationships among alphabets in the input…

We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to…