A researcher at HSE University analysed data on 1,539 doctoral students from 161 Russian universities to identify which features of a thesis topic are associated with academic success and engagement. The most important factor was found to be personal interest in the research topic, which was associated with almost all key aspects of doctoral programme experience—from engaging with the academic supervisor to research activity and confidence about successfully defending the thesis. The findings have been published in Higher Education.
Having a good defence attorney in criminal proceedings can largely determine whether a defendant retains their freedom, health and good name. Researchers at HSE University propose a method for predicting an attorney’s performance based on the outcomes of their previous cases. The methodology takes into account the severity of the charges, the complexity of the cases, and the most likely outcome, drawing on judicial statistics.
A delegation of scientists from Hanoi visited the HSE Faculty of Computer Science and then took part in a Russian-Vietnamese conference in St Petersburg. The events were part of the three-year project ‘Flexibility and Computational Methods.’ Over the course of the project, the researchers have prepared joint publications and obtained new mathematical results.
Guterman A. E., Spiridonov I.A., Linear Algebra and its Applications 2020 Vol. 599 P. 140–155
Let $M_{n}(\mathbb{F})$ denote the set of square matrices of size $n$ over a field $\mathbb{F}$ with characteristics different from two. We say that the map $f: M_{n}(\mathbb{F}) \rightarrow M_{n}(\mathbb{F})$ is additive if $f(A+B) = f(A) + f(B)$ for all $A, B \in M_{n}(\mathbb{F})$. The main goal of this paper is to prove that for $n>2$ ...
M.N.Vyalyi, Babenko A. V., Computational Mathematics and Mathematical Physics 2017 Vol. 57 No. 2 P. 362–371
The problem of linear classification of the parity of permutation matrices is studied. This problem is related to the analysis of complexity of a class of algorithms designed for computing the permanent of a matrix that generalizes the Kasteleyn algorithm. Exponential lower bounds on the magnitude of the coefficients of the functional that classifies the ...