Related papers: An algorithm for minimum cardinality generators of…

This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…

Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up…

We develop a new algorithm to compute determinants of all possible Hankel matrices made up from a given finite length sequence over a finite field. Our algorithm fits within the dynamic programming paradigm by exploiting new recursive…

We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…

First we construct minimal hypersurfaces $M\subset\mathbf{R}^{n+1}$ in a neighborhood of the origin, with an isolated singularity but cylindrical tangent cone $C\times \mathbf{R}$, for any strictly minimizing strictly stable cone $C$ in…

We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…

In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some…

In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a set of generators of the automorphism group of a graph, and test whether two graphs are isomorphic, finding an isomorphism if they are. This algorithm…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

In this paper, we analyze minimal representations of $(p,\boldsymbol{\alpha})$-power cones as simpler cones. We derive some new results on the complexity of the representations, and we provide a procedure to construct a minimal…

We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…

A bipartite graph $G=(U,V,E)$ is convex if the vertices in $V$ can be linearly ordered such that for each vertex $u\in U$, the neighbors of $u$ are consecutive in the ordering of $V$. An induced matching $H$ of $G$ is a matching such that…

We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also…

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

This work explores the binarization of the deconvolution-based generator in a GAN for memory saving and speedup of image construction. Our study suggests that different from convolutional neural networks (including the discriminator) where…

An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.

Consider a homogeneous multifold convex conic system $$ Ax = 0, \; x\in K_1\times...\times K_r $$ and its alternative system $$ A\transp y \in K_1^*\times...\times K_r^*, $$ where $K_1,..., K_r$ are regular closed convex cones. We show that…