Inverse problem for Dirac systems with locally square-summable potentials and rectangular Weyl functions

Inverse problem for Dirac systems with locally square summable potentials and rectangular Weyl functions is solved. For that purpose we use a new result on the linear similarity between operators from a subclass of triangular integral operators and the operator of integration.Comment: Some of the main results from [16] (A. Sakhnovich, Inverse Problems 18 (2002), 331--348) and the submitted to ArXiv papers[2] and [5] (see arXiv:0912.4444 and arXiv:1106.1263) are generalized for the case of the locally square-summable potentials and rectangular Weyl function

Simon Grant, Monti, Martin Osherson, Daniel

The classical theory of preference among monetary bets represents people as expected utility maximizers with nondecreasing concave utility functions. Critics of this account often rely on assumptions about preferences over wide ranges of total wealth. We derive a prediction of the theory that bears on bets at any fixed level of wealth, and test the prediction behaviorally. Our results are discrepant with the classical account. Competing theories are also examined in light of our data.

Analysis techniques for complex-field radiation pattern measurements

Complex field measurements are increasingly becoming the standard for state-of-the-art astronomical instrumentation. Complex field measurements have been used to characterize a suite of ground, airborne, and space-based heterodyne receiver missions [1], [2], [3], [4], [5], [6], and a description of how to acquire coherent field maps for direct detector arrays was demonstrated in Davis et. al. 2017. This technique has the ability to determine both amplitude and phase radiation patterns from individual pixels on an array. Phase information helps to better characterize the optical performance of the array (as compared to total power radiation patterns) by constraining the fit in an additional plane [4]. Here we discuss the mathematical framework used in an analysis pipeline developed to process complex field radiation pattern measurements. This routine determines and compensates misalignments of the instrument and scanning system. We begin with an overview of Gaussian beam formalism and how it relates to complex field pattern measurements. Next we discuss a scan strategy using an offset in z along the optical axis that allows first-order optical standing waves between the scanned source and optical system to be removed in post-processing. Also discussed is a method by which the co- and cross-polarization fields can be extracted individually for each pixel by rotating the two orthogonal measurement planes until the signal is the co-polarization map is maximized (and the signal in the cross-polarization field is minimized). We detail a minimization function that can fit measurement data to an arbitrary beam shape model. We conclude by discussing the angular plane wave spectral (APWS) method for beam propagation, including the near-field to far-field transformation

Flyer: University Lecture Series Featuring Dr. Jacqueline Wexler

“The Emerging Nation of Women”-- Dr. Jacqueline Wexler -- University Auditorium Wednesday May 29 (no year) 8:00PM, No Admission Charge -- Presented By University Public Functions Committee. Dr. Jacqueline Wexler -- As Sister Jacqueline, she developed Webster College’s Dept. of Education into a pioneering Teacher -Training and Curriculum Research Center - As a member of LBJ’s Educational Advisory council, she helped set up Project Head Start – As President of New York’s Hunter College, she speaks for the role of women in higher education and in the nation today

The Reachability Problem for Petri Nets is Not Elementary

Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack.Comment: Final version of STOC'1

Exponentially accurate solution tracking for nonlinear ODEs, the higher order Stokes phenomenon and double transseries resummation

We demonstrate the conjunction of new exponential-asymptotic effects in the context of a second order nonlinear ordinary differential equation with a small parameter. First, we show how to use a hyperasymptotic, beyond-all-orders approach to seed a numerical solver of a nonlinear ordinary differential equation with sufficiently accurate initial data so as to track a specific solution in the presence of an attractor. Second, we demonstrate the necessary role of a higher order Stokes phenomenon in analytically tracking the transition between asymptotic behaviours in a heteroclinic solution. Third, we carry out a double resummation involving both subdominant and sub-subdominant transseries to achieve the two-dimensional (in terms of the arbitrary constants) uniform approximation that allows the exploration of the behaviour of a two parameter set of solutions across wide regions of the independent variable. This is the first time all three effects have been studied jointly in the context of an asymptotic treatment of a nonlinear ordinary differential equation with a parameter. This paper provides an exponential asymptotic algorithm for attacking such problems when they occur. The availability of explicit results would depend on the individual equation under study

The reachability problem for Petri nets is not elementary

Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack

市場機構の機能と限界

Ⅰ 自由主義体制の確立　Ⅱ 市場の機能とその前提　Ⅲ 国家の政策と利益団体の生成　Ⅳ 三重の調整メカニズ

The Beurling--Malliavin Multiplier Theorem and its analogs for the de Branges spaces

Let $\omega$ be a non-negative function on $\mathbb{R}$. We are looking for a non-zero $f$ from a given space of entire functions $X$ satisfying $$(a) \quad|f|\leq \omega\text{\quad or\quad(b)}\quad |f|\asymp\omega.$$ The classical Beurling--Malliavin Multiplier Theorem corresponds to $(a)$ and the classical Paley--Wiener space as $X$. We survey recent results for the case when $X$ is a de Branges space \he. Numerous answers mainly depend on the behaviour of the phase function of the generating function $E$.Comment: Survey, 25 page