Related papers: The maximum intersection number of regular simplic…

An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

In this article we improve the upper bound for the arithmetic self-intersection number of the dualizing sheaf of the minimal regular model for the Fermat curves $F_p$ of prime exponent.

We prove that on a restricted contact type hypersurface the number of leaf-wise intersections is bounded from below by a certain cup-length.

We describe here some recent progress pertaining to the Serre Intersection Multiplicity Conjecture. In particular, we show that if A is an unramified regular local ring, then just as in the equicharacteristic case, the intersection…

In this paper, we introduce numerical cohomology for arithmetic surfaces, which leads to an absolute version of arithmetic Riemann-Roch formula. As an application, we derive an upper bound for the self-intersection number of relative…

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.

This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming…

There is presented an algorithm for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M --> R^2m,…

We define a new kind of crossing number which generalizes both the bipartite crossing number and the outerplanar crossing number. We calculate exact values of this crossing number for many complete bipartite graphs and also give a lower…

We give a bound for the Betti numbers of the Stanley-Reisner ring of a stellar subdivision of a Gorenstein* simplicial complex by applying unprojection theory. From this we derive a bound for the Betti numbers of iterated stellar…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

We show upper and lower bounds for angles in iterations of trisections of certain triangulations.

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

We obtain a lower bound of the degree of irrationality of very general complete intersections over the complex field from the recent results of the first author and Chen--Stapleton. For combining these results, we make a minor adjustment of…