Related papers: Openness of Regular Regimes of Complex Random Matr…

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

Let $E/\mathbf{Q}$ be an elliptic curve and $p\geq 3$ be a prime. We prove the $p$-converse theorems for elliptic curves of potentially good ordinary reduction at Eisenstein primes (i.e., such that the residual representation $E[p]$ is…

We study the radius of absolute monotonicity R of rational functions with numerator and denominator of degree s that approximate the exponential function to order p. Such functions arise in the application of implicit s-stage, order p…

In this paper, we study several generalizations of multiway cut where the terminals can be chosen as \emph{representatives} from sets of \emph{candidates} $T_1,\ldots,T_q$. In this setting, one is allowed to choose these representatives so…

In this note we study a minimization problem for a vector of measures subject to a prescribed interaction matrix in the presence of external potentials. The conductors are allowed to have zero distance from each other but the external…

We prove that every infinite minimal subshift with word complexity $p(q)$ satisfying $\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its maximal equicontinuous factor; in particular, it has measurably discrete spectrum. Among…

In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…

We study the Equitable Connected Partition (ECP for short) problem, where we are given a graph G=(V,E) together with an integer p, and our goal is to find a partition of V into p parts such that each part induces a connected sub-graph of G…

This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…

Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only…

We prove that dynamically defined Jacobi and CMV matrices associated with generic continuous sampling functions have all gaps predicted by the Gap Labelling Theorem open. We also give a mechanism for generic gap opening for quasi-periodic…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP)…

We study mappings that satisfy the inverse modulus inequality of Poletsky type in a fixed domain. It is shown that, under some additional restrictions, the image of a ball under such mappings contains a fixed ball uniformly over the class.…

A fundamental theorem of linear programming states that a feasible linear program is solvable if and only if its objective function is copositive with respect to the recession cone of its feasible set. This paper demonstrates that this…

A random matrix model with a sigma-model like constraint, the restricted trace ensemble (RTE), is solved in the large-n limit. In the macroscopic limit the smooth connected two-point resolvent G(z,w) is found to be non-universal, extending…

Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…

A function f is continuous iff the PRE-image f^{-1}[V] of any open set V is open again. Dual to this topological property, f is called OPEN iff the IMAGE f[U] of any open set U is open again. Several classical Open Mapping Theorems in…

Let T : Lp --> Lp be a contraction, with p strictly between 1 and infinity, and assume that T is analytic, that is, there exists a constant K such that n\norm{T^n-T^{n-1}} < K for any positive integer n. Under the assumption that T is…

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…