This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.

The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length.

The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.

In this paper, a statistical game was defined and solved. Its solution is: the optimal randomized decision rule, the probability of a correct decision on this rule, and the worst a priori distribution of the test subjects knowledge levels. We have developed a method for assessment the accuracy and reliability of decision making by on test results. The proposed program allows you to assessment the reliability of the solution for a test containing 10 items with different levels of difficulty, and 11 different levels of knowledge level.

TThe present paper proposes a model for evaluating geo-ecological protection technologies based on multi-criteria optimization and weighted convolution criteria, on the basis of which the method of calculation is developed, allowing to determine the PQ factor for different objects according to the selected technologies using the Mathlab environment. The work demonstrated the application of the technique in the case of materials made of ash foam concrete with densities and ash content from the incineration of sewage sludge. The determination of the optimum composition of solopenobeton is relevant for the design of noise shields in railway transport. The proposed simulation algorithm in the Matlab environment makes it possible to use the procedure of processing the raw data, using several options of their input: in the form of tables of the format. csv or manual input.

This is a companion book to Asymptotic Analysis of Random Walks: Heavy-Tailed Distributions by A.A. Borovkov and K.A. Borovkov. Its self-contained systematic exposition provides a highly useful resource for academic researchers and professionals interested in applications of probability in statistics, ruin theory, and queuing theory. The large deviation principle for random walks was first established by the author in 1967, under the restrictive condition that the distribution tails decay faster than exponentially. (A close assertion was proved by S.R.S. Varadhan in 1966, but only in a rather special case.) Since then, the principle has always been treated in the literature only under this condition. Recently, the author jointly with A.A. Mogul'skii removed this restriction, finding a natural metric for which the large deviation principle for random walks holds without any conditions. This new version is presented in the book, as well as a new approach to studying large deviations in boundary crossing problems. Many results presented in the book, obtained by the author himself or jointly with co-authors, are appearing in a monograph for the first time.

The Volume includes a Special Section on "Analytical and Computational Methods in Probability"

The materials of the 5th International conference on stochastic methods are presented including the following directions: probability and statistics (analytic modelling, asymptotic methods and limit theorems, stochastic analysis, Markov processes and martingales, actuarial and financial mathematics, et al.); applications of stochastic methods (queueing theory and stochastic networks, reliability theory and risk analysis, probability in indistry, economics and other areas, computer science and computer networks, machine learning and data analysis, etc.).

This is a brief textbook on complex analysis intended for the students of upper undergraduate or beginning graduate level. The author stresses the aspects of complex analysis that are most important for the student planning to study algebraic geometry and related topics. The exposition is rigorous but elementary: abstract notions are introduced only if they are really indispensable. This approach provides a motivation for the reader to digest more abstract definitions (e.g., those of sheaves or line bundles, which are not mentioned in the book) when he/she is ready for that level of abstraction indeed. In the chapter on Riemann surfaces, several key results on compact Riemann surfaces are stated and proved in the first nontrivial case, i.e. that of elliptic curves.

This book studies complex systems with elements represented by random variables. Its main goal is to study and compare uncertainty of algorithms of network structure identification with applications to market network analysis. For this, a mathematical model of random variable network is introduced, uncertainty of identification procedure is defined through a risk function, random variables networks with different measures of similarity (dependence) are discussed, and general statistical properties of identification algorithms are studied. The volume also introduces a new class of identification algorithms based on a new measure of similarity and prove its robustness in a large class of distributions, and presents applications to social networks, power transmission grids, telecommunication networks, stock market networks, and brain networks through a theoretical analysis that identifies network structures. Both researchers and graduate students in computer science, mathematics, and optimization will find the applications and techniques presented useful.

 

This book offers an introduction to the research in several recently discovered and actively developing mathematical and mathematical physics areas. It focuses on: 1) Feynman integrals and modular functions, 2) hyperbolic and Lorentzian Kac-Moody algebras, related automorphic forms and applications to quantum gravity, 3) superconformal indices and elliptic hypergeometric integrals, related instanton partition functions, 4) moonshine, its arithmetic aspects, Jacobi forms, elliptic genus, and string theory, and 5) theory and applications of the elliptic Painleve equation, and aspects of Painleve equations in quantum field theories. All the topics covered are related to various partition functions emerging in different supersymmetric and ordinary quantum field theories in curved space-times of different (d=2,3,…,6) dimensions. Presenting multidisciplinary methods (localization, Borcherds products, theory of special functions, Cremona maps, etc) for treating a range of partition functions, the book is intended for graduate students and young postdocs interested in the interaction between quantum field theory and mathematics related to automorphic forms, representation theory, number theory and geometry, and mirror symmetry. 

This book constitutes the proceedings of the 19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020, held in Novosibirsk, Russia, in July 2020. The 31 full papers presented in this volume were carefully reviewed and selected from 102 submissions. The papers are grouped in these topical sections: discrete optimization; mathematical programming; game theory; scheduling problem; heuristics and metaheuristics; and operational research applications.

This book presents recent non-asymptotic results for approximations in multivariate statistical analysis. The book is unique in its focus on results with the correct error structure for all the parameters involved. Firstly, it discusses the computable error bounds on correlation coefficients, MANOVA tests and discriminant functions studied in recent papers. It then introduces new areas of research in high-dimensional approximations for bootstrap procedures, Cornish–Fisher expansions, power-divergence statistics and approximations of statistics based on observations with random sample size. Lastly, it proposes a general approach for the construction of non-asymptotic bounds, providing relevant examples for several complicated statistics. It is a valuable resource for researchers with a basic understanding of multivariate statistics.

The materials of The International Scientific – Practical Conference is presented below. The Conference reflects the modern state of innovation in education, science, industry and social-economic sphere, from the standpoint of introducing new information technologies. It is interesting for a wide range of researchers, teachers, graduate students and professionals in the field of innovation and information technologies.

This book constitutes the proceedings of the 8th International Conference on Analysis of Images, Social Networks and Texts, AIST 2019, held in Kazan, Russia, in July 2019.

The 24 full papers and 10 short papers were carefully reviewed and selected from 134 submissions (of which 21 papers were rejected without being reviewed). The papers are organized in topical sections on general topics of data analysis; natural language processing; social network analysis; analysis of images and video; optimization problems on graphs and network structures; analysis of dynamic behaviour through event data.

Provides an overview of the developments and advances in the field of network clustering and blockmodeling over the last 10 years

This book offers an integrated treatment of network clustering and blockmodeling, covering all of the newest approaches and methods that have been developed over the last decade. Presented in a comprehensive manner, it offers the foundations for understanding network structures and processes, and features a wide variety of new techniques addressing issues that occur during the partitioning of networks across multiple disciplines such as community detection, blockmodeling of valued networks, role assignment, and stochastic blockmodeling.

Written by a team of international experts in the field, Advances in Network Clustering and Blockmodeling offers a plethora of diverse perspectives covering topics such as: bibliometric analyses of the network clustering literature; clustering approaches to networks; label propagation for clustering; and treating missing network data before partitioning. It also examines the partitioning of signed networks, multimode networks, and linked networks. A chapter on structured networks and coarsegrained descriptions is presented, along with another on scientific coauthorship networks. The book finishes with a section covering conclusions and directions for future work. In addition, the editors provide numerous tables, figures, case studies, examples, datasets, and more.

Offers a clear and insightful look at the state of the art in network clustering and blockmodeling Provides an excellent mix of mathematical rigor and practical application in a comprehensive manner Presents a suite of new methods, procedures, algorithms for partitioning networks, as well as new techniques for visualizing matrix arrays Features numerous examples throughout, enabling readers to gain a better understanding of research methods and to conduct their own research effectively Written by leading contributors in the field of spatial networks analysis

Advances in Network Clustering and Blockmodeling is an ideal book for graduate and undergraduate students taking courses on network analysis or working with networks using real data. It will also benefit researchers and practitioners interested in network analysis.

This book deals with mathematical modeling, namely, it describes the mathematical model of heat transfer in a silicon cathode of small (nano) dimensions with the possibility of partial melting taken into account.  This mathematical model is based on the phase field system, i.e., on a contemporary generalization of Stefan-type free boundary problems. The approach used is not purely mathematical but is based on the understanding of the solution structure (construction and study of asymptotic solutions) and computer calculations. The book presents an algorithm for numerical solution of the equations of the mathematical model including its parallel implementation. The results of numerical simulation concludes the book. The book is intended for specialists in the field of heat transfer and field emission processes and can be useful for senior students and postgraduates.​

This book constitutes the refereed proceedings of the 11th International Conference on Intelligent Data Processing, IDP 2016, held in Barcelona, Spain, in October 2016.  

 

The 11 revised full papers were carefully reviewed and selected from 52 submissions. The papers of this volume are organized in topical sections on machine learning theory with applications; intelligent data processing in life and social sciences; morphological and technological approaches to image analysis.

This book is devoted to classical and modern achievements in complex analysis. In order to benefit most from it, a first-year university background is sufficient; all other statements and proofs are provided.

We begin with a brief but fairly complete course on the theory of holomorphic, meromorphic, and harmonic functions. We then present a uniformization theory, and discuss a representation of the moduli space of Riemann surfaces of a fixed topological type as a factor space of a contractible space by a discrete group. Next, we consider compact Riemann surfaces and prove the classical theorems of Riemann-Roch, Abel, Weierstrass, etc. We also construct theta functions that are very important for a range of applications.

After that, we turn to modern applications of this theory. First, we build the (important for mathematics and mathematical physics) Kadomtsev-Petviashvili hierarchy and use validated results to arrive at important solutions to these differential equations. We subsequently use the theory of harmonic functions and the theory of differential hierarchies to explicitly construct a conformal mapping that translates an arbitrary contractible domain into a standard disk – a classical problem that has important applications in hydrodynamics, gas dynamics, etc.

The book is based on numerous lecture courses given by the author at the Independent University of Moscow and at the Mathematics Department of the Higher School of Economics.

In the last 30 years a new pattern of interaction between mathematics and physics emerged, in which the latter catalyzed the creation of new mathematical theories. Most notable examples of this kind of interaction can be found in the theory of moduli spaces. In algebraic geometry the theory of moduli spaces goes back at least to Riemann, but they were first rigorously constructed by Mumford only in the 1960s. The theory has experienced an extraordinary development in recent decades, finding an increasing number of connections with other fields of mathematics and physics. In particular, moduli spaces of different objects (sheaves, instantons, curves, stable maps, etc.) have been used to construct invariants (such as Donaldson, Seiberg-Witten, Gromov-Witten, Donaldson-Thomas invariants) that solve longstanding, difficult enumerative problems. These invariants are related to the partition functions and expectation values of quantum field and string theories. In recent years, developments in both fields have led to an unprecedented cross-fertilization between geometry and physics. These striking interactions between geometry and physics were the theme of the CIME School Geometric Representation Theory and Gauge Theory. The School took place at the Grand Hotel San Michele, Cetraro, Italy, in June, Monday 25 to Friday 29, 2018. The present volume is a collection of notes of the lectures delivered at the school. It consists of three articles from Alexander Braverman and Michael Finkelberg, Andrei Negut, and Alexei Oblomkov, respectively.

We construct a mirabolic analogue of the geometric Satake equivalence. We also prove an equivalence that relates representations of a supergroup to the category of GL(N − 1, C[[t]])-equivariant perverse sheaves on the affine Grassmannian of GLN . We explain how our equivalences fit into a more general framework of conjectures due to Gaiotto and to Ben-Zvi, Sakellaridis and Venkatesh.

There are two different modal logics: the logic T assuming contingency and the logic K = assuming logical determinism. In the paper, I show that the Aristotelian treatise On Interpretation (Περί ερμηνείας, De Interpretatione) has introduced some modal-logical relationships which correspond to T. In this logic, it is supposed that there are contingent events. The Nāgārjunian treatise Īśvara-kartṛtva-nirākṛtiḥ-viṣṇoḥ-ekakartṛtva-nirākaraṇa has introduced some modal-logical relationships which correspond to K =. In this logic, it is supposed that there is a logical determinism: each event happens necessarily (siddha) or it does not happen necessarily (asiddha). The Nāgārjunian approach was inherited by the Yogācārins who developed, first, the doctrine of causality of all real entities (arthakriyātva) and, second, the doctrine of momentariness of all real entities (kṣaṇikavāda). Both doctrines were a philosophical ground of the Yogācārins for the logical determinism. Hence, Aristotle implicitly used the logic T in his modal reasoning. The Madhyamaka and Yogācāra schools implicitly used the logic K = in their modal reasoning.

We consider a linear-quadratic control problem where a time parameter evolves according to a stochastic time scale. The stochastic time scale is defined via a stochastic process with continuously differentiable paths. We obtain an optimal infinite-time control law under criteria similar to the long-run averages. Some examples of stochastic time scales from various applications have been examined.

Transition to chaos via the destruction of a two-dimensional torus is studied numerically using an example of the Hénon map and the Toda oscillator under quasiperiodic forcing and also experimentally using an example of a quasi-periodically excited RL–diode circuit. A feature of chaotic dynamics in these systems is the fact that the chaotic attractor in them has an additional zero Lyapunov exponent, which strictly follows from the structure of mathematical models. In the process of research, the influence of feedback is studied, in which the frequency of one of the harmonics of external forcing becomes dependent on a dynamic variable. Charts of dynamic regimes were constructed, examples of typical oscillation modes were given, and the spectrum of Lyapunov exponents was analyzed. Numerical simulations confirm that chaos resulting from the cascade of torus doubling has a close to the zero Lyapunov exponent, beside the trivial zero exponent.

In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial coefficients, adjugate, and inverse in real Clifford algebras (or geometric algebras) over vector spaces of arbitrary dimension $n$. The formulas involve only the operations of multiplication, summation, and operations of conjugation without explicit use of matrix representation. We use methods of Clifford algebras (including the method of quaternion typification proposed by the author in previous papers and the method of operations of conjugation of special type presented in this paper) and generalizations of numerical methods of matrix theory (the Faddeev-LeVerrier algorithm based on the Cayley-Hamilton theorem; the method of calculating the characteristic polynomial coefficients using Bell polynomials) to the case of Clifford algebras in this paper. We present the construction of operations of conjugation of special type and study relations between these operations and the projection operations onto fixed subspaces of Clifford algebras. We use this construction in the analytical proof of formulas for the determinant, other characteristic polynomial coefficients, adjugate, and inverse in Clifford algebras. The basis-free formulas for the inverse give us basis-free solutions to linear algebraic equations, which are widely used in computer science, image and signal processing, physics, engineering, control theory, etc. The results of this paper can be used in symbolic computation.

In this crowdsourced initiative, independent analysts used the same dataset to test two hypotheses regarding the effects of scientists’ gender and professional status on verbosity during group meetings. Not only the analytic approach but also the operationalizations of key variables were left unconstrained and up to individual analysts. For instance, analysts could choose to operationalize status as job title, institutional ranking, citation counts, or some combination. To maximize transparency regarding the process by which analytic choices are made, the analysts used a platform we developed called DataExplained to justify both preferred and rejected analytic paths in real time. Analyses lacking sufficient detail, reproducible code, or with statistical errors were excluded, resulting in 29 analyses in the final sample. Researchers reported radically different analyses and dispersed empirical outcomes, in a number of cases obtaining significant effects in opposite directions for the same research question. A Boba multiverse analysis demonstrates that decisions about how to operationalize variables explain variability in outcomes above and beyond statistical choices (e.g., covariates). Subjective researcher decisions play a critical role in driving the reported empirical results, underscoring the need for open data, systematic robustness checks, and transparency regarding both analytic paths taken and not taken. Implications for organizations and leaders, whose decision making relies in part on scientific findings, consulting reports, and internal analyses by data scientists, are discussed.

We explore several types of functional relations on the family of multivariate Tutte polynomials: the Biggs formula and the star-triangle (Y−ΔY−Δ) transformation at the critical point n=2n=2. We deduce the theorem of Matiyasevich and its inverse from the Biggs formula, and we apply this relation to construct the recursion on the parameter nn. We provide two different proofs of the Zamolodchikov tetrahedron equation satisfied by the star-triangle transformation in the case of n=2n=2 multivariate Tutte polynomial, we extend the latter to the case of valency 2 points and show that the Biggs formula and the star-triangle transformation commute.

In many rare disease Phase II clinical trials, two objectives are of interest to an investigator: maximising the statistical power and maximising the number of patients responding to the treatment. These two objectives are competing, therefore, clinical trial designs offering a balance between them are needed. Recently, it was argued that response-adaptive designs such as families of multi-arm bandit (MAB) methods could provide the means for achieving this balance. Furthermore, response-adaptive designs based on a concept of context-dependent (weighted) information criteria were recently proposed with a focus on Shannon’s differential entropy. The information-theoretic designs based on the weighted Renyi, Tsallis and Fisher informations are also proposed. Due to built-in parameters of these novel designs, the balance between the statistical power and the number of patients that respond to the treatment can be tuned explicitly. The asymptotic properties of these measures are studied in order to construct intuitive criteria for arm selection. A comprehensive simulation study shows that using the exact criteria over asymptotic ones or using information measures with more parameters, namely Renyi and Tsallis entropies, brings no sufficient gain in terms of the power or proportion of patients allocated to superior treatments. The proposed designs based on information-theoretical criteria are compared to several alternative approaches. For example, via tuning of the built-in parameter, one can find designs with power comparable to the fixed equal randomisation’s but a greater number of patients responded in the trials.

Using the path integral approach, we obtain the characteristic functions of the gyration radius distributions for Gaussian star and Gaussian rosette macromolecules. We derive the analytical expressions for cumulants of both distributions. Applying the steepest descent method, we estimate the probability distribution functions (PDFs) of the gyration radius in the limit of a large number of star and rosette arms in two limiting regimes: for strongly expanded and strongly collapsed macromolecules. We show that in both cases, in the regime of a large gyration radius relative to its mean-square value, the PDFs can be described by the Gaussian functions. In the shrunk macromolecule regime, both distribution functions tend to zero faster than any power of the gyration radius. Based on the asymptotic behavior of the distribution functions and the behavior of statistical dispersions, we demonstrate that the PDF for the rosette is more densely localized near its maximum than that for the star polymer. We construct the interpolation formula for the gyration radius distribution of the Gaussian star macromolecule which can help to take into account the conformational entropy of the flexible star macromolecules within the Flory-type mean-field theories.

We consider the damped/driven cubic NLS equation on the torus of a large period L with a small nonlinearity of size λ, a properly scaled random forcing and dissipation. We examine its solutions under the subsequent limit when first λ → 0 and then L → ∞. The first limit, called the limit of discrete turbulence, is known to exist, and in this work we study the second limit L → ∞ for solutions to the equations of discrete turbulence. Namely, we decompose the solutions to formal series in amplitude and study the second order truncation of this series. We prove that the energy spectrum of the truncated solutions becomes close to solutions of a damped/driven nonlinear wave kinetic equation. Kinetic nonlinearity of the latter is similar to that which usually appears in works on wave turbulence, but is different from it (in particular, it is non-autonomous). Apart from tools from analysis and stochastic analysis, our work uses two powerful results from the number theory.

For the optimal success probability under minimum-error discrimination of N≥2 arbitrary quantum states, we find new general lower and upper bounds and specify the relations between these new general bounds and the general bounds known in the literature. The new upper bound explicitly generalizes to N>2 the form of the Helstrom bound. For N=2, each of our new bounds, lower and upper, reduces to the Helstrom bound.

In 2021, Dzhunusov and Zaitseva classified two-dimensional normal affine commutative algebraic monoids. In this work, we extend this classification to noncommutative monoid structures on normal affine surfaces. We prove that two-dimensional algebraic monoids are toric. We also show how to find all monoid structures on a normal toric surface. Every such structure is induced by a comultiplication formula involving Demazure roots. We also give descriptions of opposite monoids, quotient monoids, and boundary divisors.

For each integer n>0, we construct a series of irreducible algebraic varieties X, for which the automorphism group Aut(X) contains as a subgroup the automorphism group Aut(F_n) of a free group F_n of rank n. For n > 1, such groups Aut(X) are nonamenable, and for n > 2, they are nonlinear and contain the braid group B_n. Some of these varieties X are affine, and among affine, some are rational and some are not, some are smooth and some are singular. The byproduct is that for n > 2, each Cremona group of rank > 3n-1 contains Aut(F_n) and the braid group B_n.

Starting with exploration of the possibility to present the underlying variety of an affine algebraic group in the form of a product of some algebraic varieties, we then explore the naturally arising problem as to what extent the group variety of an algebraic group determines its group structure.

The dynamics of a multiplex heterogeneous network of oscillators is studied. Two types of similar models based on the Hodgkin-Huxley formalism are used as the basic elements of the networks. The first type model demonstrates bursting oscillations. The second model demonstrates bistability between bursting attractor and stable steady state. Basin of attraction of the stable equilibrium in the model is very small. Bistabilty is a result taking into account an additional ion channel, which has a non-monotonic characteristic and can be interpreted as a channel with a communication defect. Suggested multiplex networks assumed more active communication between models with a defect as a result in such networks it is enough to have one element with a communication defect in the subnetworks in order to stabilize the state of equilibrium in the entire network.

We give several characterizations of relative homological epimorphisms in the setting of locally convex topological algebras, thereby correcting a gap in our earlier paper [Trans. Moscow Math. Soc. 2008, 27-104].

Given a connected reductive algebraic group G and a Borel subgroup B⊆G, we study B-normalized one-parameter additive group actions on affine spherical G-varieties. We establish basic properties of such actions and their weights and discuss many examples exhibiting various features. We propose a construction of such actions that generalizes the well-known construction of normalized one-parameter additive group actions on affine toric varieties. Using this construction, for every affine horospherical G-variety X we obtain a complete description of all G-normalized one-parameter additive group actions on X and show that the open G-orbit in X can be connected with every G-stable prime divisor via a suitable choice of a B-normalized one-parameter additive group action. Finally, when G is of semisimple rank 1, we obtain a complete description of all B-normalized one-parameter additive group actions on affine spherical G-varieties having an open orbit of a maximal torus T⊆B.

As an effort to help contain the COVID-19 pandemic, large numbers of SARS-CoV-2 genomes have been sequenced from all continents. More than one million viral sequences are publicly available as of April 2021. Many studies estimate viral genealogies from these sequences, as these can provide valuable information about the spread of the pandemic across time and space. Additionally such data are a rich source of information about molecular evolutionary processes including natural selection, for example allowing the identification and investigating the spread of new variants conferring transmissibility and immunity evasion advantages to the virus. To validate new methods and to verify results resulting from these vast datasets, one needs an efficient simulator able to simulate the pandemic to approximate world-scale scenarios and generate viral genealogies of millions of samples. Here, we introduce a new fast simulator VGsim which addresses this problem. The simulation process is split into two phases. During the forward run the algorithm generates a chain of events reflecting the dynamics of the pandemic using an hierarchical version of the Gillespie algorithm. During the backward run a coalescent-like approach generates a tree genealogy of samples conditioning on the events chain generated during the forward run. Our software can model complex population structure, epistasis and immunity escape. The code is freely available at https://github.com/Genomics-HSE/VGsim.

The guarantee of an anonymous mechanism is the worst case welfare an agent can secure against unanimously adversarial others. How high can such a guarantee be, and what type of mechanism achieves it? We address the worst case design question in the n-person probabilistic voting/bargaining model with p deterministic outcomes. If n is no less than p the uniform lottery is the only maximal (unimprovable) guarantee; there are many more if p>n, in particular the ones inspired by the random dictator mechanism and by voting by veto. If n=2 the maximal set M(n,p) is a simple polytope where each vertex combines a round of vetoes with one of random dictatorship. For p>n>2, we show that the dual veto and random dictator guarantees, together with the uniform one, are the building blocks of 2 to the power d simplices of dimension d in M(n,p), where d is the quotient of p-1 by n. Their vertices are guarantees easy to interpret and implement. The set M(n,p) may contain other guarantees as well; what we can say in full generality is that it is a finite union of polytopes, all sharing the uniform guarantee.

Convergence of order O(1/ √ n) is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The weights are assumed to be independent identically distributed random variables which have a power-law distribution. The proof is based on the Chen–Stein approach and on the derived properties of the ratio of the sum of squares of random variables and the sum of these variables. These properties can be applied to other asymptotic problems related to generalized random graphs

Several results on presenting an affine algebraic group variety as a product of algebraic varieties are obtained.

We show existence of a natural rational structure on periodic cyclic homology, conjectured by L. Katzarkov, M. Kontsevich, T. Pantev, for several classes of dg-categories, including proper connective C-dg-algebras and dg-categories of local systems. The main ingredient is derived nilpotent invariance of A. Blanc's semi-topological K-theory, which we establish along the way.

We prove that a finite 3-group in the Cremona group Cr_3(ℂ) can be generated by at most 4 elements. This provides the last missing piece in bounding the ranks of finite p-subgroups in the space Cremona group.

We consider an initial-boundary value problem for the $n$-dimensional wave equation with the variable sound speed, $n\geq 1$. We construct three-level implicit in time compact in space (three-point in each space direction) 4th order finite-difference schemes on the uniform rectangular meshes including their one-parameter (for $n=2$) and three-parameter (for $n=3$) families. They are closely connected to some methods and schemes constructed recently by several authors. In a unified manner, we prove the conditional stability of schemes in the strong and weak energy norms together with the 4th order error estimate under natural conditions on the time step. We also give an example of extending a compact scheme for non-uniform in space and time rectangular meshes. We suggest simple effective iterative methods based on FFT to implement the schemes whose convergence rate, under the stability condition, is fast and independent on both the meshes and variable sound speed. A new effective initial guess to start iterations is given too. We also present promising results of numerical experiments.

We present the construction of an original stochastic model for the instantaneous turbulent kinetic energy at a given point of a flow, and we validate estimator methods on this model with observational data examples. Motivated by the need for wind energy industry of acquiring relevant statistical information of air motion at a local place, we adopt the Lagrangian description of fluid flows to derive, from the 3D+time equations of the physics, a 0D+time-stochastic model for the time series of the instantaneous turbulent kinetic energy at a given position. Specifically, based on the Lagrangian stochastic description of a generic fluid-particles, we derive a family of mean-field dynamics featuring the square norm of the turbulent velocity. By approximating at equilibrium the characteristic nonlinear terms of the dynamics, we recover the so called Cox-Ingersoll-Ross process, which was previously suggested in the literature for modelling wind speed. We then propose a calibration procedure for the parameters employing both direct methods and Bayesian inference. In particular, we show the consistency of the estimators and validate the model through the quantification of uncertainty, with respect to the range of values given in the literature for some physical constants of turbulence modelling.

Let M be the space of triangles, defined up to shifts, rotations and dilations. We define two maps f:M->M and g:M->M.  The map f corresponds to a triangle of perimeter pi the triangle with angles numerically equal to edges of the initial triangle. The map g corresponds to a triangle of perimeter 2pi the triangle with exterior angles numerically equal to edges of the initial triangle. For p in M the sequence {p,f(p),f(f(p)),...} converges to the equilateral triangle and the sequence {p,g(p),g(g(p)),...} converges to the "degenerate triangle" with angles (0,0,pi). In Supplement an analogous problem about inscribed-circumscribed quadrangles is discussed.