相关论文: Simultaneous $p$-orderings and minimising volumes …

It is shown by the author in 2017 that for the union of N orthants in the n-dimensional space there exists an efficient and systematic way to find the exact value, using a suitable partial order relation construction. In this paper our…

Motivated by the known mathematical and physical problems arising from the current mathematical formalization of the physical spatio-temporal continuum, as a substantial technical clarification of our earlier attempt, the aim in this paper…

More than twenty-five years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

We extend the scope of B. Shapirovskii's results [B.E Shapirovskii, "Cardinal invariants in Compact Hausdorff Spaces," Amer. Math. Soc. Transl. (2) Vol. 134, 1987, pp. 93-118] on the order of $\pi$-bases in compact spaces and answer some…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to determine the sizes of the smallest percolating sets in multidimensional tori…

Let $\Gamma\subset \bar{\mathbb Q}^{\times}$ be a finitely generated multiplicative group of algebraic numbers. Let $\alpha_1,\ldots,\alpha_r\in\bar{\mathbb Q}^\times$ be algebraic numbers which are $\mathbb{Q}$-linearly independent and let…

We prove existence of minimizers for the sharp Poincar\'e-Sobolev constant in general Steiner symmetric sets, in the subcritical and superhomogeneous regime. The sets considered are not necessarily bounded, thus the relevant embeddings may…

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

We prove upper bounds on the number of rational points on transcendental curves in arbitrary $1$-h-minimal fields, similar to the Pila--Wilkie counting theorem in the o-minimal setting. These results extend results due to…

We study universal cycles of the set ${\cal P}(n,k)$ of $k$-partitions of the set $[n]:=\{1,2,\ldots,n\}$ and prove that the transition digraph associated with ${\cal P}(n,k)$ is Eulerian. But this does not imply that universal cycles (or…

Consider the problem, usually called the P\'olya-Chebotarev problem, of finding a continuum in the complex plane including some given points such that the logarithmic capacity of this continuum is minimal. We prove that each connected…

First we consider the following problem which dates back to Chebyshev, Zolotarev and Achieser: among all trigonometric polynomials with given leading coefficients $a_0,...,a_l,$ $b_0,...,b_l \in \mathbb R$ find that one with least maximum…

In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…

The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…

For integers $k\ge 2$ and $N\ge 2k+1$ there are $k!2^k$ canonical orderings of the edges of the complete $k$-uniform hypergraph with vertex set $[N] = \{1,2,\dots, N\}$. These are exactly the orderings with the property that any two subsets…

The Fourier restriction phenomenon and the size of Kakeya sets are explored in the setting of the ring of integers modulo $N$ for general $N$ and a striking similarity with the corresponding euclidean problems is observed. One should…