Related papers: A formula for the minimal coordination number of a…
We study the classic sliding cube model for programmable matter under parallel reconfiguration in three dimensions, providing novel algorithmic and surprising complexity results in addition to generalizing the best known bounds from two to…
Concentration-compactness is used to prove compactness of maximising sequences for a variational problem governing symmetric steady vortex-pairs in a uniform planar ideal fluid flow, where the kinetic energy is to be maximised and the…
The paper presents a methodology to enhance the stiffness analysis of parallel manipulators with parallelogram-based linkage. It directly takes into account the influence of the external loading and allows computing both the non-linear…
We formulate problems of tight closure theory in terms of projective bundles and subbundles. This provides a geometric interpretation of such problems and allows us to apply intersection theory to them. This yields new results concerning…
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of hard spheres of (chemical) radius one, and they are found to…
J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020) constructed some optimal and minimal binary linear codes generated by one or two order ideals in hierarchical posets of two levels. At the end of their paper, they left…
The first-order flex space of the bar-joint framework $G_P$ of a parallelogram tiling $P$ is determined in terms of an explicit free basis. Applications are given to braced parallelogram frameworks and to quasicrystal frameworks associated…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
We parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.
The realization of tractor bundles as associated bundles in conformal geometry is studied. It is shown that different natural choices of principal bundle with normal Cartan connection corresponding to a given conformal manifold can give…
In the first part of this paper, we obtain symmetric formulae for the probabilities that a plane convex body hits exactly 1, 2, 3, 4, 5 or 6 triangles of a lattice of congruent triangles in the plane. Furthermore, a very simple formula for…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
A common problem in the optimization of structures is the handling of uncertainties in the parameters. If the parameters appear in the constraints, the uncertainties can lead to an infinite number of constraints. Usually the constraints…
A representation of the Pad\'e approximation of the $Z$-transform of a signal as a resolvent of a tridiagonal matrix $J$ is given. Several formulas for the poles, zeros and residues of the Pad\'e approximation in terms of the matrix $J$ are…
In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented…
The paper proposes a novel approach for the geometrical model calibration of quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is based on the observations of the manipulator leg parallelism during motions between…
We compute the minimal angle spread with respect to the uniform distribution in the probability simplex. The resulting optimization problem is analytically solved. The formula provided shows that the minimal angle spread approaches zero as…
Given a line bundle L on a smooth projective curve over the complex numbers, we show that a general extension E of L by the trivial line bundle is very stable: line bundles contained in E have degree much less than half the degree of E.…
We study the minimum number of maximum matchings in a bipartite multigraph G with parts $X$ and $Y$ under various conditions, refining the well-known lower bound due to M. Hall. When $|X|=n$, every vertex in $X$ has degree at least $k$, and…