Related papers: Strange Expectations and the Winnie-the-Pooh Probl…

We show how the techniques of Voevodsky's proof of the Milnor conjecture and the Voevodsky- Rost proof of its generalization the Bloch-Kato conjecture can be used to study counterexamples to the classical L\"uroth problem. By generalizing a…

For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…

We study a dual pair of general linear Lie superalgebras in the sense of R. Howe. We give an explicit multiplicity-free decomposition of a symmetric and skew-symmetric algebra (in the super sense) under the action of the dual pair and…

We study a natural generalization of the notion of cores for l-partitions attached with a multi-charge s $\in$ Z^l : the (e, s)-cores. We rely them both to the combinatorics and the notion of weight defined by Fayers. Next we study…

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

We present the Mathematica application LieART (Lie Algebras and Representation Theory) for computations frequently encountered in Lie Algebras and representation theory, such as tensor product decomposition and subalgebra branching of…

Let $\fg$ be the Lie superalgebra $\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\fg$ were given by the second author in 1996, and by J. Brundan in 2003. We give a combinatorial proof of…

This paper is based on the observation that dimension of weight spaces of multi-variable Weyl modules depends polynomially on the highest weight (Conjecture 1). We support this conjecture by various explicit answers for up to three variable…

Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…

In this note we present some results that were already conjectured in the work [9] by Bildhauer, Fuchs and Weickert, where they have investigated analytical aspects of coupled variational models with applications to mathematical imaging.…

This paper considers one of the fundamental parallel-in-time methods for the solution of ordinary differential equations, Parareal, and extends it by adopting a neural network as a coarse propagator. We provide a theoretical analysis of the…

The decomposition problem of the enveloping algebra of a simple Lie algebra is reconsidered combining both the analytical and the algebraic approach, showing its relation with the internal labelling problem with respect to a nilpotent…

In this paper, the correspondence between the finite dimensional representations of a simple Lie algebra and their characteristic polynomials is established, and a monoid structure on these characteristic polynomials is constructed.…

New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…

Theoretical background of continuous contractions of finite-dimensional Lie algebras is rigorously formulated and developed. In particular, known necessary criteria of contractions are collected and new criteria are proposed. A number of…

We present a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a Riemann surface of genus g to…

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

We initiate the representation theory of restricted Lie superalgebras over an algebraically closed field of characteristic p>2. A superalgebra generalization of the celebrated Kac-Weisfeiler Conjecture is formulated, which exhibits a…

We consider the problem of inference in higher-order undirected graphical models with binary labels. We formulate this problem as a binary polynomial optimization problem and propose several linear programming relaxations for it. We compare…

Linear codes with large minimal distances are important error correcting codes in information theory.Orthogonal codes have more applications in the other fields of mathematics. In this paper, we study the binary and ternary orthogonal codes…