Related papers: Balanced configurations of 2n+1 plane vectors
A balanced configuration of points on the sphere $S^2$ is a (finite) set of points which are in equilibrium if they act on each other according any force law dependent only on the distance between two points. The configuration is…
Theorem A. Let $x_1,...,x_{2k+1}$ be unit vectors in a normed plane. Then there exist signs $\epsi_1,...,\epsi_{2k+1}\in\{\pm 1\}$ such that $\norm{\sum_{i=1}^{2k+1}\epsi_i x_i}\leq 1$. We use the method of proof of the above theorem to…
Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…
Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…
We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…
Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
A configuration of particles confined to a sphere is balanced if it is in equilibrium under all force laws (that act between pairs of points with strength given by a fixed function of distance). It is straightforward to show that every…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…
We introduce a notion of balanced configurations of vectors. This is motivated by the study of rational A-hypergeometric functions in the sense of Gelfand, Kapranov and Zelevinsky. We classify balanced configurations of seven plane vectors…
Suppose that for some unit vectors $b_1,\ldots b_n$ in $\mathbb C^d$ we have that for any $j\neq k$ $b_j$ is either orthogonal to $b_k$ or $|\langle b_j,b_k\rangle|^2 = 1/d$ (i.e. $b_j$ and $b_k$ are unbiased). We prove that if $n=d(d+1)$,…
This paper is dedicated to the classification of uniform vector bundles of rank $d+1$ over the Grassmannian $G(d,n)$ ($d\le n-d$) over an algebraically closed field in characteristic $0$. Specifically, we show that all uniform vector…
The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes which has all non-zero $0/1$-vectors in $\mathbb{R}^n$ as normal vectors. It is the adjoint of the Braid arrangement and is also called the all-subsets arrangement.…
A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…
We show that the stability problem and the problem of constructing Barabanov norms can be resolved for planar linear switching systems in an explicit form. This can be done for every compact control set of $2 \times 2$ matrices. If the…
We consider the problem of determining all pairs (c_1, c_2) of Chern classes of rank 2 bundles that are cokernel of a skew-symmetric matrix of linear forms in 3 variables, having constant rank 2c_1 and size 2c_1+2. We completely solve the…
We discuss a general strategy which produces an orthonormal set of vectors, stable under the action of a given set of unitary operators $A_j$, $j=1,2,...,n$, starting from a fixed normalized vector in $\Hil$ and from a set of unitary…
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…
A set $U$ of unit vectors is selectively balancing if one can find two disjoint subsets $U^+$ and $U^-$, not both empty, such that the Euclidean distance between the sum of $U^+$ and the sum of $U^-$ is smaller than $1$. We prove that the…