Related papers: Algorithms on the Pyasetskii involution on local L…
We consider generalizations of the classical inverse problem to Bayesien type estimators, where the result is not one optimal parameter but an optimal probability distribution in parameter space. The practical computational tool to compute…
Continuous input signals like images and time series that are irregularly sampled or have missing values are challenging for existing deep learning methods. Coherently defined feature representations must depend on the values in unobserved…
Matrix Fourier-like integrals over the classical groups O_+(n), O_-(n), Sp(n) and U(n) are connected with the distribution of the length of the longest increasing sequence in random permutations and random involutions and the spectrum of…
We propose a cooperative coevolutionary genetic algorithm for learning Bayesian network structures from fully observable data sets. Since this problem can be decomposed into two dependent subproblems, that is to find an ordering of the…
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez & Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…
We present a full list of all representations of the special linear group $\mathrm{SL}_n$ over the complex numbers with complete intersection invariant ring, completing the classification of Shmelkin. For this task, we combine three…
We show that the method of factorizing the evolution operator to fourth order with purely positive coefficients, in conjunction with Suzuki's method of implementing time-ordering of operators, produces a new class of powerful algorithms for…
We present a probabilistic quantum algorithm for preparing mixed states which, in expectation, are proportional to the solutions of Lyapunov equations -- linear matrix equations ubiquitous in the analysis of classical and quantum dynamical…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
The Gross-Pitaevskii equation with a local cubic nonlinearity that describes a many-dimensional system in an external field is considered in the framework of the complex WKB-Maslov method. Analytic asymptotic solutions are constructed in…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
Predictions for physical systems often rely upon knowledge acquired from ensembles of entities, e.g., ensembles of cells in biological sciences. For qualitative and quantitative analysis, these ensembles are simulated with parametric…
We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…
We provide an algorithm for detecting the involutions leaving a surface defined by a polynomial parametrization invariant. As a consequence, the symmetry axes, symmetry planes and symmetry center of the surface, if any, can be determined…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
The Rankin-Selberg method for studying Langlands' automorphic $L$-functions is to find integral representations, involving certain Fourier coefficients of cusp forms and Eisenstein series, for these functions. In this thesis we develop the…
In this work, we explicitly compute a certain family of twisted gamma factors of a simple supercuspidal representation $\pi$ of a $p$-adic odd orthogonal group. These computations, together with analogous computations for general linear…
In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general…