Related papers: Bisector energy and few distinct distances

Let $X \subset \mathbb{P}^n$ be a non-singular hypersurface of degree $d>1$, and let $\epsilon>0$. This paper is concerned with the conjecture that there are $O(B^{n-1+\epsilon})$ rational points on $X$ that have height at most $B$, in…

Motivated by the linear time algorithm that locates the eigenvalues of a cograph G [10], we investigate the multiplicity of eigenvalue for \lambda \neq -1,0. For cographs with balanced cotrees we determine explicitly the highest value for…

It is shown that in a sequence of randomly generated bipartite configurations with number of left nodes approaching infinity, the probability that a particular configuration in the sequence has a minimum bisection width proportional to the…

For a relativistic particle moving in the presence of mean scalar and vector fields, the energy at second order in the scalar field is shown to contain two contributions in general. One is a momentum-dependent repulsive interaction…

The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of length n. In this paper we answer a question posed by Jacobs et…

We prove that in every metric space where no line contains all the points, there are at least $\Omega(n^{2/3})$ lines. This improves the previous $\Omega(\sqrt{n})$ lower bound on the number of lines in general metric space, and also…

We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth rates) There exist bosonic gate sets which increase energy…

In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every $i\geq 0$, $\Ppoly$ has $i$th order scaled $\pthree$-strong dimension 0. We also show that $\Ppoly^\io$ has…

This paper gives an elementary proof of an improved version of the algebraic Local B\'ezout Theorem (given by the authors in JSC 45 (2010) 975--985). Here we remove some ad hoc hypotheses and obtain an optimal algebraic version of the…

Multiple pendulums are investigated numerically and analytically to clarify the nonuniformity of average kinetic energies of particles. The nonuniformity is attributed to the system having constraints and it is consistent with the…

We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…

This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration…

We construct a set $M_d$ whose points parametrize families of Meixner polynomials in $d$ variables. There is a natural bispectral involution $b$ on $M_d$ which corresponds to a symmetry between the variables and the degree indices of the…

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

We introduce the concept of self-energy dispersion as an error bound on local theories and apply it to the two-dimensional Hubbard model on the square lattice at half-filling. Since the self-energy has no single-particle analog and is not…

By the m-spectrum of a real number q>1 we mean the set Y^m(q) of values p(q) where p runs over the height m polynomials with integer coefficients. These sets have been extensively investigated during the last fifty years because of their…

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…

We consider the following Lane-Emden system with Neumann boundary conditions \[ -\Delta u= |v|^{q-1}v \text{ in } \Omega,\qquad -\Delta v= |u|^{p-1}u \text{ in } \Omega,\qquad \partial_\nu u=\partial_\nu v=0 \text{ on } \partial \Omega, \]…

Consider the following Lane-Emden system with Dirichlet boundary conditions: \[ -\Delta U = |V|^{\beta-1}V,\ -\Delta V = |U|^{\alpha-1}U \text{ in }\Omega,\qquad U=V= 0 \text{ on }\partial \Omega, \] in a bounded domain $\Omega$, for…