相关论文: Pseudo-loop conditions
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a deterministic black-box identity testing algorithm for…
In the present paper, a systematic study is made of quantitative semicontinuity (a.k.a. Lipschitzian) properties of certain multifunctions, which are defined as a solution map associated to a family of parameterized ``split" feasibility…
We establish lower semicontinuity results for perimeter functionals with measure data on $\mathbb{R}^n$ and deduce the existence of minimizers to these functionals with Dirichlet boundary conditions, obstacles, or volume-constraints. In…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
As a generalization of entanglement entropy, pseudo entropy is not always real. The real-valued pseudo entropy has promising applications in holography and quantum phase transition. We apply the notion of pseudo-Hermticity to formulate the…
We present a new inductive rule for verifying lower bounds on expected values of random variables after execution of probabilistic loops as well as on their expected runtimes. Our rule is simple in the sense that loop body semantics need to…
Consider a quantum cat map $M$ associated to a matrix $A\in\mathop{\mathrm{Sp}}(2n,\mathbb Z)$, which is a common toy model in quantum chaos. We show that the mass of eigenfunctions of $M$ on any nonempty open set in the position-frequency…
Let M be a smooth compact connected manifold, on which there exists an effective smooth circle action preserving a positive smooth volume. We show that on M, the smooth closure of the smooth volume-preserving conjugation class of some…
For one-dimensional Schroedinger operators with complex-valued potentials, we construct pseudomodes corresponding to large pseudoeigenvalues. Our (non-semi-classical) approach results in substantial progress in achieving optimal conditions…
The paper is devoted to the development of new sufficient conditions for the calmness and the Aubin property of implicit multifunctions. As the basic tool one employs the directional limiting coderivative which, together with the graphical…
We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such…
We exhibit rationally ergodic, weakly mixing measure preserving transformations which are not subsequence rationally weakly mixing and give a condition for smoothness of renewal sequences.
We identify new sufficiency conditions for coercivity of general multivariate polynomials $f\in\mathbb{R}[x]$ which are expressed in terms of their Newton polytopes at infinity and which consist of a system of affine-linear inequalities in…
In this paper, we study the regularity assumptions commonly adopted in bilevel optimization with constrained lower-level problems, including the linear independence constraint qualification, the strict complementary slackness condition, and…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…
We study smoothness of generalized solutions of nonlocal elliptic problems in plane bounded domains with piecewise smooth boundary. The case where the support of nonlocal terms can intersect the boundary is considered. We find conditions…
In this note, a condition (\emph{open persistence}) is presented under which a (pre)closure operation on submodules (resp. ideals) over rings of global sections over a scheme $X$ can be extended to a (pre)closure operation on sheaves of…
Depending on the behaviour of the complex-valued electromagnetic potential in the neighbourhood of infinity, pseudomodes of one-dimensional Dirac operators corresponding to large pseudoeigenvalues are constructed. This is a first systematic…
Frank-Wolfe methods are popular for optimization over a polytope. One of the reasons is because they do not need projection onto the polytope but only linear optimization over it. To understand its complexity, Lacoste-Julien and Jaggi…
We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…