Related papers: Combinatorial and Additive Number Theory Problem S…
Students of quantum mechanics encounter discrete quantum numbers in a somewhat incoherent and bewildering number of ways. For each physical system studied, quantum numbers seem to be introduced in its own specific way, some enumerating from…
Some aspects of Computer Algebra (notably Computation Group Theory and Computational Number Theory) have some good databases of examples, typically of the form "all the X up to size n". But most of the others, especially on the polynomial…
In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…
This course of lectures has been taught for several years at the Lomonosov Moscow State University; its modified version in 2021 is read in the Zhejiang University (Hangzhou), in the framework of summer school on quantum computing. The…
These notes are the second part of the tensor calculus documents which started with the previous set of introductory. In the present text, we continue the discussion of selected topics of the subject at a higher level expanding, when…
Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced…
These third-year lecture notes are designed for a 1-semester course in topological quantum field theory (TQFT). Assumed background in mathematics and physics are only standard second-year subjects: multivariable calculus, introduction to…
As the preface to the special issue for the conference ``Quantum Information and Probability: from Foundations to Engineering'' (QIP23), I wrote these notes with recollection about V\"axj\"o conferences. These conferences covered 25 years…
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an "easy-hard" phase…
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics. This version is an update June 2010.
Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum…
The optimal matching of point clouds in $\mathbb{R}^d$ is a combinatorial problem; applications in statistics motivate to consider random point clouds, like the Poisson point process. There is a crucial dependance on dimension $d$, with…
CIPANP 2009 is the tenth meeting of this series. I look back at some of the key events of past meetings, comment on a few of the presentations of this meeting, and look foward to the next CIPANP gathering, when first data from the LHC will…
For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…
The lecture, given at the ICM 2014 in Seoul, explores several problems of analytic number theory in the context of function fields over a finite field, where they can be approached by methods different than those of traditional analytic…
These lecture notes cover 13 sessions and are presented as an e-print, intended to evolve over time. Quantum invariants do more than distinguish topological objects; they build bridges between topology, algebra, number theory and quantum…
This is an extended version of a talk given at the conference "Algebra and Topology in Interaction" on the occasion of the 70th Anniversary of D.B. Fuchs at UC Davis in September 2009. It is a brief survey of an area originated around 1995…
The new millennium's qualitative advances in relativistic heavy ion physics are in part due to, and are in part causing, a new appreciation for quantitative rigor in both experimental and theoretical work in the field. In these proceedings…
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and…
The conference `Geometric and Asymptotic Group Theory with Applications (GAGTA) 2023: Groups and Dynamics' took place at the Erwin Schr\"odinger Institute on July 17-21. These are the problems that were proposed during the Problem Session:…