Related papers: Cut and project sets with polytopal window I: comp…
In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and…
We address the scaling limits of random curves arising from, e.g., planar lattice models, especially in rough domains. The well-known precompactness conditions of Kemppainen and Smirnov show that certain crossing probability estimates…
In this article, we obtain quasiconformal extensions of some classes of conformal maps defined either on the unit disc or on the exterior of it onto the extended complex plane. Some of these extensions have been obtained by constructing…
We prove that a relatively compact pseudoconvex domain with smooth boundary in an almost complex manifold admits a bounded strictly plurisubharmonic exhaustion function. We use this result for the study of convexity and hyperbolicity…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
In a second seminal paper on the application of semidefinite programming to graph partitioning problems, Goemans and Williamson showed how to formulate and round a complex semidefinite program to give what is to date still the best-known…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
The condition number of a smooth convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
We show that for quasi-compact quasi-separated schemes of finite dimension, the constructibility condition in real \'etale cohomology agrees with a notion of constructibility arising naturally from topology. As application we prove that the…
We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…
This manuscript explores novel complexity results for the feasibility problem over $p$-order cones, extending the foundational work of Porkolab and Khachiyan. By leveraging the intrinsic structure of $p$-order cones, we derive refined…
We study the validity of (q,p)-Poincar\'e inequalities, q<p, on domains in R^n which satisfy a quasihyperbolic boundary condition, i.e. domains whose quasihyperbolic metric satisfies a logarithmic growth condition. In the present paper, we…
Critical, or scale independent, systems are so ubiquitous, that gaining theoretical insights on their nature and properties has many direct repercussions in social and natural sciences. In this report, we start from the simplest possible…
The quasi likelihood analysis is generalized to the partial quasi likelihood analysis. Limit theorems for the quasi likelihood estimators, especially the quasi Bayesian estimator, are derived in the situation where existence of a slow…
Complex systems have motivated continuing interest from the scientific community, leading to new concepts and methods. Growing systems represent a case of particular interest, as their topological, geometrical, and also dynamical properties…
We show that every continuous homogeneous quasimorphism on a finite-dimensional 1-connected simple Lie group arises as the relative growth of any continuous bi-invariant partial order on that group. More generally we show, that an arbitrary…
This paper studies the asymptotic growth and decay properties of solutions of the stochastic pantograph equation with multiplicative noise. We give sufficient conditions on the parameters for solutions to grow at a polynomial rate in $p$-th…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
We introduce the projected Green's function technique to study quasi-periodic systems such as the Andre-Aubry-Harper (AAH) model and beyond. In particular, we use projected Green's functions to construct a "rational approximate" sequence of…