Related papers: Absorbing sets of homogeneous subtractive algorith…

There are many ideas for developing shock-capturing schemes and their extension for all-speed flow. The representatives of them are Roe, HLL and AUSM families. In this paper, a uniform algorithm is proposed, which expresses three families…

We discuss recent developments in the study of semiorthogonal decompositions of algebraic varieties with an emphasis on their behaviour in families. First, we overview new results concerning homological projective duality. Then we introduce…

Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…

We construct certain non-degenerate maps and sets, mainly in the complex-analytic category. For example, we show that for every countable subset S in an irreducible complex space X there exists a holomorphic map from the unit disk to X such…

In this work, the assembly map in L-theory for the family of finite subgroups is proven to be a split injection for a class of groups. Groups in this class, including virtually polycyclic groups, have universal spaces that satisfy certain…

We introduce a new infinite class of superintegrable quantum systems in the plane. Their Hamiltonians involve reflection operators. The associated Schr\"odinger equations admit separation of variables in polar coordinates and are exactly…

We consider deterministic homogenization (convergence to a stochastic differential equation) for multiscale systems of the form \[ x_{k+1} = x_k + n^{-1} a_n(x_k,y_k) + n^{-1/2} b_n(x_k,y_k), \quad y_{k+1} = T_n y_k, \] where the fast…

Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…

The implementation of global optimization algorithms, using the arithmetic of infinity, is considered. A relatively simple version of implementation is proposed for the algorithms that possess the introduced property of strong homogeneity.…

For a subvariety of a smooth projective variety, consider the family of smooth hypersurfaces of sufficiently large degree containing it, and take the quotient of the middle cohomology of the hypersurfaces by the cohomology of the ambient…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clustering and are widely…

The two-dimensional homogeneous Euclidean algorithm is the central motivation for the definition of the classical multidimensional continued fraction algorithms, as Jacobi-Perron, Poincar\'e, Brun and Selmer algorithms. The Rauzy induction,…

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…

Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…

The concept of a uniform set is introduced for an ergodic, measure-preserving transformation on a non-atomic, infinite Lebesgue space. The uniform sets exist as much as they generate the underlying $\sigma$-algebra. This leads to the result…

A theory of allocation maps has been developed by J. F. Feinstein and M. J. Heath in order to prove a theorem, using Zorn's lemma, concerning the compact plane sets known as Swiss cheese sets. These sets are important since, as domains,…

The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields insight into the hierarchy of complexity classes. In particular, the theory produces algebraic tests for a…