相关论文: Recent Progress in Algebraic Combinatorics
The purpose of these notes is describe the state of progress on the restriction problem in harmonic analysis, with an emphasis on the developments of the past decade or so on the Euclidean space version of these problems for spheres and…
Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to…
Aspects of a generalized representation theory of current algebras in $3+1$ dimensions are discussed in terms of the Fock bundle method, the sesquilinear form approach (of Langmann and Ruijsenaars), and Hilbert space cocycles.
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is…
Over the past few years there has been considerable progress in the structural understanding of special Colombeau algebras. We present some of the main trends in this development: non-smooth differential geometry, locally convex theory of…
We study two different one-parameter generalizations of Littlewood--Richardson coefficients, namely Hall polynomials and generalized inverse Kostka polynomials, and derive new combinatorial formulae for them. Our combinatorial expressions…
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
The paper is a survey of notions and results related to classical and new generalizations of the notion of a periodic sequence. The topics related to almost periodicity in combinatorics on words, symbolic dynamics, expressibility in logical…
Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…
A survey written for the upcoming "Handbook of Enumerative Combinatorics".
This paper deals with Lavrentiev regularization for solving linear ill-posed problems, mostly with respect to accretive operators on Hilbert spaces. We present converse and saturation results which are an important part in regularization…
An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section…
We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a…
Various notions of joint majorization are examined in continuous matrix algebras. The relative strengths of these notions are established via proofs and examples. In addition, the closed convex hulls of joint unitary orbits are completely…
The seminal concept of characteristic polygon of an embedded algebroid surface, first developed by Hironaka, seems well suited for combinatorially (perhaps even effectively) tracking of a resolution process. However, the way this object…
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…
In the present paper we discuss some recent versions of localisation methods for calculations in the groups of points of algebraic-like and classical-like groups. Namely, we describe relative localisation, universal localisation, and…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…