相关论文: KL-randomness and effective dimension under strong…

We revisit extending the Kolmogorov-Smirnov distance between probability distributions to the multidimensional setting and make new arguments about the proper way to approach this generalization. Our proposed formulation maximizes the…

In the mentioned paper we presented results of the estimation of Kolmogorov complexity of sequences of random numbers generated in a famous Bell's experiment, aimed to study the security of QKD. We focused on series of time differences…

We consider filtered or graded algebras $A$ over a field $K$. Assume that there is a discrete valuation $O_v$ of $K$ with $m_v$ its maximal ideal and $k_v:=O_v/m_v$ its residue field. Let $\Lambda$ be $O_v$-order such that $\Lambda K=A$ and…

We show that differentiable functions, defined on a convex body $K \subseteq \mathbb R^d$, whose derivatives do not exceed a suitable given sequence of positive real numbers share many properties with polynomials. The role of the degree of…

In the large rank limit, for any nonexceptional affine algebra, the graded branching multiplicities known as one-dimensional sums, are conjectured to have a simple relationship with those of type A, which are known as generalized Kostka…

When analyzing modern machine learning algorithms, we may need to handle kernel density estimation (KDE) with intricate kernels that are not designed by the user and might even be irregular and asymmetric. To handle this emerging challenge,…

In this thesis we use the Beauville-Bogomolov decomposition to compute the LLV algebra of smooth projective complex varieties admitting a holomorphic symplectic form, generalizing known results from hyperk\"ahler and abelian varieties.…

We define and study a recurrence relation in ${\mathbb Z}^3$, called the hexahedron recurrence, which is similar to the octahedron recurrence (Hirota bilinear difference equation) and cube recurrence (Miwa equation). Like these examples,…

We analytically derive the geometrical structure of the weight space in multilayer neural networks (MLN), in terms of the volumes of couplings associated to the internal representations of the training set. Focusing on the parity and…

Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…

The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences $A$ and $B$, $B$ is Martin-L\"of random and $A$ is…

We establish the multiplicity conjecture of Herzog, Huneke, and Srinivasan about the multiplicity of graded Cohen-Macaulay algebras over a field, for codimension two algebras and for Gorenstein algebras of codimension three. In fact, we…

Langevin diffusion is a commonly used tool for sampling from a given distribution. In this work, we establish that when the target density $p^*$ is such that $\log p^*$ is $L$ smooth and $m$ strongly convex, discrete Langevin diffusion…

We consider the problem of estimating probability density functions based on sample data, using a finite mixture of densities from some component class. To this end, we introduce the $h$-lifted Kullback--Leibler (KL) divergence as a…

In this paper we study higher level Deligne--Lusztig representations of reductive groups over discrete valuation rings, with finite residue field $\mathbb{F}_q$. In previous work we proved that, at even levels, these geometrically…

The paper is an implementation in low dimensional cases of the classification method presented before by Rakhimov and Bekbaev. We give a complete classification of a subclass of complex filiform Leibniz algebras obtained from the naturally…

We study the problem of closeness testing for continuous distributions and its implications for causal discovery. Specifically, we analyze the sample complexity of distinguishing whether two multidimensional continuous distributions are…

We study the problem of maximum likelihood (ML) estimation for statistical models defined by reflexive polytopes. Our focus is on the maximum likelihood degree of these models as an algebraic measure of complexity of the corresponding…

We construct a family of graded isomorphisms between certain subquotients of diagrammatic Cherednik algebras as the quantum characteristic, multicharge, level, degree, and weighting are allowed to vary; this provides new structural…

We show that in case a cluster algebra coincides with its upper cluster algebra and the cluster algebra admits a grading with finite dimensional homogeneous components, the corresponding Berenstein-Zelevinsky quantum cluster algebra can be…