相关论文: Discrete Mixed Quantization

We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…

We relate Berezin-Toeplitz quantization of higher rank vector bundles to quantum-classical hybrid systems and quantization in stages of symplectic fibrations. We apply this picture to the analysis and geometry of vector bundles, including…

We establish an asymptotic relation between the spectrum of the discrete Laplacian associated to discretizations of a half-translation surface with a flat unitary vector bundle and the spectrum of the Friedrichs extension of the Laplacian…

Bundle pricing refers to designing several product combinations (i.e., bundles) and determining their prices in order to maximize the expected profit. It is a classic problem in revenue management and arises in many industries, such as…

R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…

We develop the theory of a new type of asymptotic expansions for functions of two variables the coefficients of which contain functions of one of the variables as well as functions of the quotient of these two variables. These combined…

We develop the theory of a new type of asymptotic expansions for functions of two variables the coefficients of which contain functions of one of the variables as well as functions of the quotient of these two variables. These combined…

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

In this paper, we investigate a restricted version of Bergman kernels for high powers of a big line bundle over a smooth projective variety. The geometric meaning of the leading term is specified. As a byproduct, we derive some integral…

We extend balloon and sample-smoothing estimators, two types of variable-bandwidth kernel density estimators, by a shift parameter and derive their asymptotic properties. Our approach facilitates the unified study of a wide range of density…

The vector transform operators are investigated; these operators are used at the solution of boundary value problems in piecewise homogeneous spherically symmetric areas. In particular, examples of transformation operators for vector…

We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…

In this series of eight papers we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In this part we consider the applications of discrete wavelet analysis…

We systematically compute improved asymptotic rank bounds for tensors. Using numerical implicitization, we implement the geometric framework of Kaski and Micha{\l}ek across all computationally feasible cases. By detecting the absence of…

We study second-order divergence-form systems on half-infinite cylindrical domains with a bounded and possibly rough base, subject to homogeneous mixed boundary conditions on the lateral boundary and square integrable Dirichlet, Neumann, or…

Model selection, via penalized likelihood type criteria, is a standard task in many statistical inference and machine learning problems. Progress has led to deriving criteria with asymptotic consistency results and an increasing emphasis on…

We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

The purpose of this paper is to introduce two new classes of accelerated distributed proximal conjugate gradient algorithms for multi-agent constrained optimization problems; given as minimization of a function decomposed as a sum of M…