Related papers: Maximal integral point sets over $\mathbb{Z}^2$
In this paper, an upper bound for the number of integral points of bounded height on an affine complete intersection defined over $\mathbb{Z}$ is proven. The proof uses an extension to complete intersections of the method used for…
Let $\mathcal{I}$ be an analytic P-ideal [respectively, a summable ideal] on the positive integers and let $(x_n)$ be a sequence taking values in a metric space $X$. First, it is shown that the set of ideal limit points of $(x_n)$ is an…
We study open sets $\mathcal{P}$ in normed spaces $X$ attaining a large volume while avoiding pairs of points at integral distance. The proposed task is to find sharp inequalities for the maximum possible $d$-dimensional volume. This…
Finding a maximum independent set (MIS) of a given fam- ily of axis-parallel rectangles is a basic problem in computational geom- etry and combinatorics. This problem has attracted significant atten- tion since the sixties, when Wegner…
Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…
Strongly bounded groups are those groups for which every action by isometries on a metric space has orbits of finite diameter. Many groups have been shown to have this property, and all the known infinite examples so far have cardinality at…
We study the maximum cardinality problem of a set of few distances in the Hamming and Johnson spaces. We formulate semidefinite programs for this problem and extend the 2011 works by Barg-Musin and Musin-Nozaki. As our main result, we find…
A bounded subset of a normed linear space is said to be (diametrically) complete if it cannot be enlarged without increasing the diameter. A complete super set of a bounded set $K$ having the same diameter as $K$ is called a completion of…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
An algebraic integer is said large if all its real or complex embeddings have absolute value larger than $1$. An integral ideal is said \emph{large} if it admits a large generator. We investigate the notion of largeness, relating it to some…
Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…
Let $X$ be a compact metric space and let $|A|$ denote the cardinality of a set $A$. We prove that if $f\colon X\to X$ is a homeomorphism and $|X|=\infty$ then for all $\delta>0$ there is $A\subset X$ such that $|A|=4$ and for all $k\in Z$…
For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
Given a finite poset P, we consider pairs of linear extensions of P with maximal distance, where the distance between two linear extensions L_1, L_2 is the number of pairs of elements of P appearing in different orders in L_1 and L_2. A…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm…
We look at the maximal entropy (MME) measure of the boundaries of connected components of the Fatou set of a rational map of degree greater than or equal to 2. We show that if there are infinitely many Fatou components, and if either the…
For a finite set of points $X$ on the unit hypersphere in $\mathbb{R}^d$ we consider the iteration $u_{i+1}=u_i+\chi_i$, where $\chi_i$ is the point of $X$ farthest from $u_i$. Restricting to the case where the origin is contained in the…