On the Asymptotic Behavior of Solutions of the Heat Equation with a Random,Long-Range Correlated Potential

In this note we investigate the asymptotic behavior of the solutions of the heat equation with random, fast oscillating potential

Weighted Hardy operators and commutators on Morrey spaces

The operator norms of weighted Hardy operators on Morrey spaces are worked out. The other purpose of this paper is to establish a sufficient and necessary condition on weight functions which ensures the boundedness of the commutators of weighted Hardy operators (with symbols in BMO(ℝ ⁿ )) on Morrey spaces.     

On <Emphasis Type="Italic">g</Emphasis>-measures in symbolic dynamics

Finitary Markov processes are described in G. Morvai and B. Weiss, Prediction for discrete time series, Probability Theory and Related Fields 132 (2005), 1–12. The transition functions of finitary Markov processes are residually locally constant g-functions that can be extended by continuity to their maximal domain of definition. The study of their associated symbolic dynamics leads one to the D-shifts as introduced in W. Krieger, On g-functions for subshifts, Institute of Mathematical Statistics Lecture Notes-Monograph Series, Vol. 48, Dynamics & Stochastics, arXiv:math.DS/0608259, (2006), 306–316, We study the phenomena that can arise in residually locally constant and locally constant maximally defined g-functions on D-shifts, Markov shifts and synchronizing systems with respect to future measures and g-measures     

Composition-diamond lemma for modules

We investigate the relationship between the Gröbner-Shirshov bases in free associative algebras, free left modules and “double-free” left modules (that is, free modules over a free algebra). We first give Chibrikov’s Composition-Diamond lemma for modules and then we show that Kang-Lee’s Composition-Diamond lemma follows from it. We give the Gröbner-Shirshov bases for the following modules: the highest weight module over a Lie algebra sl ₂, the Verma module over a Kac-Moody algebra, the Verma module over the Lie algebra of coefficients of a free conformal algebra, and a universal enveloping module for a Sabinin algebra. As applications, we also obtain linear bases for the above modules.     

Simultaneous estimation and variable selection in median regression using Lasso-type penalty

We consider the median regression with a LASSO-type penalty term for variable selection. With the fixed number of variables in regression model, a two-stage method is proposed for simultaneous estimation and variable selection where the degree of penalty is adaptively chosen. A Bayesian information criterion type approach is proposed and used to obtain a data-driven procedure which is proved to automatically select asymptotically optimal tuning parameters. It is shown that the resultant estimator achieves the so-called oracle property. The combination of the median regression and LASSO penalty is computationally easy to implement via the standard linear programming. A random perturbation scheme can be made use of to get simple estimator of the standard error. Simulation studies are conducted to assess the finite-sample performance of the proposed method. We illustrate the methodology with a real example.     

Cauchy’s residue theorem for a class of real valued functions

Let [a, b] be an interval in ℝ Rand let F be a real valued function defined at the endpoints of [a, b] and with a certain number of discontinuities within [a, b]. Assuming F to be differentiable on a set [a, b] | E to the derivative f, where E is a subset of [a, b] at whose points F can take values ±∞ or not be defined at all, we adopt the convention that F and f are equal to 0 at all points of E and show that KH-vt ∝ _a ^b f = F(b) − F(a), where KH-vt denotes the total value of the Kurzweil-Henstock integral. The paper ends with a few examples that illustrate the theory.     

New Results on EX Graphs

By the extremal number ex(n; t) = ex(n; {C ₃, C ₄, . . . , C _t }) we denote the maximum size (that is, number of edges) in a graph of order n > t and girth at least g ≥ t + 1. The set of all the graphs of order n, containing no cycles of length ≥ t, and of size ex(n; t), is denoted by EX(n; t) = EX(n; {C ₃, C ₄, . . . , C _t }), these graphs are called EX graphs. In 1975, Erdős proposed the problem of determining the extremal numbers ex(n; 4) of a graph of order n and girth at least 5. In this paper, we consider a generalized version of this problem, for t ≥ 5. In particular, we prove that ex(29; 6) = 45, also we improve some lower bounds and upper bounds of ex _u (n; t), for some particular values of n and t.     

Niche width and scale in organizational competition: A computational approach

In some organizational applications, the principle of allocation (PoA) and scale advantage (SA) oppose each other. While PoA implies that organizations with wide niches get punished, SA holds that large organizations gain an advantage because of scale efficiencies. The opposition occurs because many large organizations also possess wide niches. However, analyzing these theoretical mechanisms implies a possible trade-off between niche width and size: if both PoA and SA are strong, then organizations must be either focused or large to survive, resulting in a dual market structure, as proposed by the theory of resource partitioning. This article develops a computational model used to study this trade-off, and investigates the properties of organizational populations with low/high SA and low/high PoA. The model generates three expected core “corner” solutions: (1) the dominance of large organizations in the strong SA setting; (2) the proliferation of narrow-niche organizations in the strong PoA setting; and (3) a bifurcated or dual market structure if both SA and PoA are present. The model also allows us to identify circumstances under which narrow-niche (specialists) or wide-niche (generalists) organizations thrive. We also use the model to examine the claim that concentrated resource distributions are more likely to generate partitioned or bifurcated populations. We also investigate the consequences of environments comprised of ordered versus unordered positions.     

A <Emphasis Type="Italic">p</Emphasis>-adic RANSAC algorithm for stereo vision using Hensel lifting

A p-adic variation of the Ran(dom) Sa(mple) C(onsensus) method for solving the relative pose problem in stereo vision is developed. From two 2-adically encoded images a random sample of five pairs of corresponding points is taken, and the equations for the essential matrix are solved by lifting solutions modulo 2 to the 2-adic integers. A recently devised p-adic hierarchical classification algorithm imitiating the known LBG quantization method classifies the solutions for all the samples after having determined the number of clusters using the known intra-inter validity of clusterings. In the successful case, a cluster ranking will determine the cluster containing a 2-adic approximation to the “true” solution of the problem.     

Arrangements on Parametric Surfaces II: Concretizations and Applications

We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arrangements embedded on certain two-dimensional orientable parametric surfaces in three-dimensional space. The fundamentals of the framework are described in a companion paper. Our work covers arrangements embedded on elliptic quadrics and cyclides induced by intersections with other algebraic surfaces, and a specialized case of arrangements induced by arcs of great circles embedded on the sphere. We also demonstrate how such arrangements can be used to accomplish various geometric tasks efficiently, such as computing the Minkowski sums of polytopes, the envelope of surfaces, and Voronoi diagrams embedded on parametric surfaces. We do not assume general position. Namely, we handle degenerate input, and produce exact results in all cases. Our implementation is realized using Cgal and, in particular, the package that provides the underlying framework. We have conducted experiments on various data sets, and documented the practical efficiency of our approach.