相关论文: Grassmann convexity and multiplicative Sturm theor…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

Using the polynomial method in additive number theory, this article establishes a new addition theorem for the set of subsums of a set satisfying $A\cap(-A)=\emptyset$ in $\mathbb{Z}/p\mathbb{Z}$:…

In this paper, we confirm two conjectures proposed by Georgiev, G\'{o}mez-Serrano, Tao, and Wagner~\cite{GGTW25} on Schoenberg type inequalities of order $4$, thereby providing a complete solution to the de Bruin--Sharma problem. We further…

In the theory of submanifolds, the following problem is fundamental: to establish simple relationships between the main intrinsic invariants and the main extrinsic invariants of the submanifolds.The basic relationships discovered until now…

Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…

We prove that any centered $1$-subgaussian random vector in $\mathbb{R}^{n}$ can be written as the sum of a universal number of standard Gaussian vectors. Following the work of the second-named author, this solves M. Talagrand's convexity…

We obtain sharp maximal vanishing order at a given time level for solutions to parabolic equations with a $C{^1}$ potential $V$. Our main result Theorem 1.1 is a parabolic generalization of a well known result of Donnelly-Fefferman and…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

We study the maximum of a Gaussian field on $[0,1]^\d$ ($\d \geq 1$) whose correlations decay logarithmically with the distance. Kahane \cite{Kah85} introduced this model to construct mathematically the Gaussian multiplicative chaos in the…

The article is concerned with the problem of the additivity of the tensor rank. That is for two independent tensors we study when the rank of their direct sum is equal to the sum of their individual ranks. The statement saying that…

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…

We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…

The purpose of this article is to study the convergence of a low order finite element approximation for a natural convection problem. We prove that the discretization based on P1 polynomials for every variable (velocity, pressure and…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Solving a singular linear system for an individual vector solution is an ill-posed problem with a condition number infinity. From an alternative perspective, however, the general solution of a singular system is of a bounded sensitivity as…

We show that, for first-order systems of conservation laws with a strictly convex entropy,in particular for the very simple so-called "inviscid" Burgers equation,it is possible to address the Cauchy problem by a suitable convex…