Related papers: A formula for the minimal coordination number of a…
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
This paper presents a methodology for solving a geometrically robust least squares problem, which arises in various applications where the model is subject to geometric constraints. The problem is formulated as a minimax optimization…
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the…
We describe moduli spaces of logarithmic rank $2$ connections on elliptic curves with $n \geq 1$ poles and generic residues. In particular, we generalize a previous work by the first and second named authors. Our main approach is to analyze…
We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange…
We study the stability of some homogeneous bundles on P^3 by using their representations of the quiver associated to the homgeneous bundles on P^3. In particular we show that homogeneous bundles on P^3 whose support of the quiver…
We investigate coordination numbers of the cubic lattices with emphases on their analytic behaviors, including the total positivity of the coordination matrices, the distribution of zeros of the coordination polynomials, the asymptotic…
Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
The problem for consistency between linear transports along paths and real bundle metrics in real vector bundles is stated. Necessary and/or sufficient conditions, as well as conditions for existence, for such consistency are derived. All…
The aim of this article is to proof a necessary and sufficient condition for the existence of a Cartan connection on a principal bundle. After collecting the essentially well known facts to fix the terminology, soldering forms and…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
The lattice of monotone triangles $(\mathfrak{M}_n,\le)$ ordered by entry-wise comparisons is studied. Let $\tau_{\min}$ denote the unique minimal element in this lattice, and $\tau_{\max}$ the unique maximum. The number of $r$-tuples of…
In this article we study the minimal time for the exact controllability of one-dimensional first-order linear hyperbolic systems when all the controls are acting on the same side of the boundary. We establish an explicit and easy-to-compute…
The edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the…
In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…