Related papers: Proof of admissible weights
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
The definition of principal nest is supplemented with a system of frames that make possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…
Admissible orders on fuzzy numbers are total orders which refine a basic and well-known partial order on fuzzy numbers. In this work, we define an admissible order on triangular fuzzy numbers (i.e. TFN's) and study some fundamental…
Assessing sensitivity to unmeasured confounding is an important step in observational studies, which typically estimate effects under the assumption that all confounders are measured. In this paper, we develop a sensitivity analysis…
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
The main result of this paper is that conditional measures of generalized Ginibre point processes, with respect to the configuration in the complement of a bounded open subset on $\mathbb{C}$, are orthogonal polynomial ensembles with…
We study here weighted polynomial multiple ergodic averages. A sequence of weights is called universally good if any polynomial multiple ergodic average with this sequence of weights converges in $L^{2}$. We find a necessary condition and…
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…
The aim of this paper is to study $ m $-isometric weighted shifts with operator weights (both unilateral and bilateral). We obtain a characterization of such shifts by polynomials with operator coefficients. The procedure of construction of…
These notes contain, among others, a proof that the average running time of an easy solution to the satisfiability problem for propositional calculus is, under some reasonable assumptions, linear (with constant 2) in the size of the input.…
Interpretability is an elusive but highly sought-after characteristic of modern machine learning methods. Recent work has focused on interpretability via $\textit{explanations}$, which justify individual model predictions. In this work, we…
Given an elliptic operator $P$ on a non-compact manifold (with proper asymptotic conditions), there is a discrete set of numbers called indicial roots. It's known that $P$ is Fredholm between weighted Sobolev spaces if and only if the…
The operations of linear algebra, calculus, and statistics are routinely applied to measurement scales but certain mathematical conditions must be satisfied in order for these operations to be applicable. We call attention to the conditions…
We prove in this note one weight norm inequalities for some positive Bergman-type operators.
Matrix valued Laguerre polynomials are introduced via a matrix weight function involving several degrees of freedom using the matrix nature. Under suitable conditions on the parameters the matrix weight function satisfies matrix Pearson…
We prove that if an amenable operator algebra is nearly contained in a complemented dual operator algebra, then it can be embedded inside this dual operator algebra via a similarity. The proof relies on a B.E. Johnson Theorem on…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…