相关论文: On a question of Alon

Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

A little-known and highly economical characterization of the real interval [0, 1], essentially due to Freyd, states that the interval is homeomorphic to two copies of itself glued end to end, and, in a precise sense, is universal as such.…

We consider a homogeneous system of linear equations of the form $A_\alpha^{\otimes N} {\bf x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_\alpha$ depends on a…

We prove that if a homogeneous, continuously differentiable vector field is asymptotically stable, then it admits a Lyapunov function which is the ratio of two polynomials (i.e., a rational function). We further show that when the vector…

Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…

A set $D \subseteq \mathbb{N}$ is called $r$-large if every $r$-coloring of $\mathbb{N}$ admits arbitrarily long monochromatic arithmetic progressions $a,a+d,...,a+(k-1)d$ with gap $d \in D$. Closely related to largeness is accessibility; a…

We classify general square systems of polynomial equations solvable in radicals. Expectedly, they are almost in a 1-to-1 correspondence with tuples of lattice polytopes of mixed volume not exceeding 4. The proof is based on the computation…

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

Algebraic varieties which are locally isomorphic to open subsets of affine space will be called {\em plain}. Plain varieties are smooth and rational. The converse is true for curves and surfaces, and unknown in general. It is shown that…

Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

An expression for the coefficients of a linear iterative equation in terms of the parameters of the source equation is given both for equations in standard form and for equations in reduced normal form. The operator generating an iterative…

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of…

In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…

A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. Marigliano and Davies conjectured that every linear binomial that appears in…

We prove Tur\'an-type theorems for two related Ramsey problems raised by Bollob\'as and by Fox and Sudakov. First, for $t \ge 3$, we show that any two-colouring of the complete graph on $n$ vertices that is $\delta$-far from being…