Related papers: An algorithm for minimum cardinality generators of…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…
Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…
We describe a new algorithm that computes the minimal list of inequalities for the moment cone of any representation of a complex reductive group, with implementation details for two fundamental cases: the Kronecker cone (governing the…
We give a simple recursion for the minimal generators $G=\{g_i\}$ of the generic value set $\Lambda_{gen}$ of a plane curve germ $C$ with a two-generator semigroup $\Gamma \langle p, m \rangle$. The main result provides for explicit…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…
We study the lattice of divisor-closed submonoids of finitely generated cancellative commutative monoids. In case the monoid is an affine semigroup, we give a geometrical characterization of such submonoids in terms of its cone. Finally, we…
A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis and an extensive evaluation. However, engineering such…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
A generating set $S$ for a group $G$ is independent if the subgroup generated by $S\setminus \{s\}$ is properly contained in $G$, for all $s \in S.$ In this paper, we study a problem proposed by Peter Glasby: we investigate finite groups,…
This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to implement and optimal both with regards to the amount of random…
In this article we prove that for a large class of 2-dimensional minimal cones (including almost all 2-dimensional minimal cones that we know), the almost orthogonal union of any two of them is still a minimal cone. Comparing to existing…
A vertex $v\in V$ is said to resolve two vertices $x$ and $y$ if $d_G(v,x)\ne d_G(v,y)$. A set $S\subset V$ is said to be a metric generator for $G$ if any pair of vertices of $G$ is resolved by some element of $S$. A minimum metric…
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation…
Existing image generator networks rely heavily on spatial convolutions and, optionally, self-attention blocks in order to gradually synthesize images in a coarse-to-fine manner. Here, we present a new architecture for image generators,…
We consider a compound testing problem within the Gaussian sequence model in which the null and alternative are specified by a pair of closed, convex cones. Such cone testing problem arise in various applications, including detection of…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…