Related papers: An algorithm for minimum cardinality generators of…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
Finding the minimum distance of linear codes is an NP-hard problem. Traditionally, this computation has been addressed by means of the design of algorithms that find, by a clever exhaustive search, a linear combination of some generating…
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
We develop a decomposition algorithm for distributionally-robust two-stage stochastic mixed-integer convex cone programs, and its important special case of distributionally-robust two-stage stochastic mixed-integer second order cone…
We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum…
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our…
Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…
This paper presents rigorous forward error bounds for linear conic optimization problems. The error bounds are formulated in a quite general framework; the underlying vector spaces are not required to be finite-dimensional, and the convex…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
We consider the problem of efficiently computing the derivative of the solution map of a convex cone program, when it exists. We do this by implicitly differentiating the residual map for its homogeneous self-dual embedding, and solving the…
We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…
A procedure for generating non-differentiable, continuously differentiable, and twice continuously differentiable classes of test functions for multiextremal multidimensional box-constrained global optimization and a corresponding package…
We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…
It has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by…
Consider a compact connected Lie group $G$ and the corresponding Lie algebra $\cal L$. Let $\{X_1,...,X_m\}$ be a set of generators for the Lie algebra $\cal L$. We prove that $G$ is uniformly finitely generated by $\{X_1,...,X_m\}$. This…
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…
Let $C$ be a Gorenstein non complete intersection monomial curve in the 4-dimensional affine space. In this paper we study the minimal number of generators of the tangent cone of $C$. Special attention will be paid to the case where $C$ has…
The present paper is devoted to the study of the well-posedness of a type of BSDEs with triangularly quadratic generators. This work is motivated by the recent results obtained by Hu and Tang [14] and Xing and \v{Z}itkovi\'{c} [28]. By the…