Related papers: Characterization algorithms for shift radix system…

We characterize the diagonalizable subalgebras of End(V), the full ring of linear operators on a vector space V over a field, in a manner that directly generalizes the classical theory of diagonalizable algebras of operators on a…

A remarkable result at the intersection of number theory and group theory states that the order of a finite group $G$ (denoted $|G|$) is divisible by the dimension $d_R$ of any irreducible complex representation of $G$. We show that the…

For nonexpansive fixed-point problems, Halpern's method with optimal parameters, its so-called H-dual algorithm, and in fact, an infinite family of algorithms containing them, all exhibit the exactly minimax optimal convergence rates. In…

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of…

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any…

The two main theorems proved here are as follows: If $A$ is a finite dimensional algebra over an algebraically closed field, the identity component of the algebraic group of outer automorphisms of $A$ is invariant under derived equivalence.…

In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is…

Within the confined phase of (2+1)D lattice gauge theories a roughening transition arises between a weakly confined regime with floppy string excitations and a strongly confined regime with stiff string excitations. In this work, we use an…

We address optimization of nonlinear functions of the form $f(Wx)$, where $f:\R^d\to \R$ is a nonlinear function, $W$ is a $d\times n$ matrix, and feasible $x$ are in some large finite set $F$ of integer points in $\R^n$. One motivation is…

We show that topological characterization and classification in $D$-dimensional systems, which are thermodynamically large in only $D-\delta$ dimensions and finite in size in $\delta$ dimensions, is fundamentally different from that of…

We give robust recovery results for synchronization on the rotation group, $\mathrm{SO}(D)$. In particular, we consider an adversarial corruption setting, where a limited percentage of the observations are arbitrarily corrupted. We give a…

Finite element codes typically use data structures that represent unstructured meshes as collections of cells, faces, and edges, each of which require associated coordinate systems. One then needs to store how the coordinate system of each…

We consider a unitary representation of the Dihedral group $D_{2n}% =\mathbb{Z}_{n}\rtimes\mathbb{Z}_{2}$ obtained by inducing the trivial character from the co-normal subgroup $\left\{0\right\}\rtimes\mathbb{Z}_{2}.$ This representation is…

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for…

We study a catching-up algorithm for a class of differential inclusions driven by maximal monotone operators with continuous perturbations. Using a decomposition of the monotone operator into the closed convex hull of its single-valued part…

We study the fundamental problem of polytope membership aiming at large convex polytopes, i.e. in high dimension and with many facets, given as an intersection of halfspaces. Standard data-structures as well as brute force methods cannot…

Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…