?
On generating series of finitely presented operads, v.3
Cornell University
,
2014.
No. arXiv:1202.5170.
Given an operad P with a finite Grobner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function for the sequence {dim P(n)} is differential algebraic, and in fact algebraic for P is a symmetrization of a non-symmetric operad. If, in addition, the growth of the dimensions P(n) is bounded by an exponent of n (or a polynomial of n, in the non-symmetric case) then, Moreover, the ordinary generating function for the above sequence {dim P(n)} is rational. We give a number of examples of calculations and discuss conjectures about the above generating functions for more general classes of operads.
Research target:
Mathematics
Language:
English
Publication based on the results of:
Markaryan N. S., / Cornell University. Series arXiv "math". 2020.
We apply Weyl n-algebras to prove formality theorems for higher Hochschild cohomology. We present two approaches: via propagators and via the factorization complex. It is shown that the second approach is equivalent to the first one taken with a new family of propagators we introduce. ...
Added: October 16, 2020
Khoroshkin, A., Markarian, N., Shadrin, S., Communications in Mathematical Physics 2013 Vol. 322 No. 3 P. 697-729
We give an explicit formula for a quasi-isomorphism between the operads Hycomm (the homology of the moduli space of stable genus 0 curves) and BV/Δ (the homotopy quotient of Batalin-Vilkovisky operad by the BV-operator). In other words we derive an equivalence of Hycomm-algebras and BV-algebras enhanced with a homotopy that trivializes the BV-operator. These formulas ...
Added: August 23, 2013
A.I. Zobnin, Programming and Computer Software 2010 Vol. 36 No. 2 P. 75-82
This survey paper presents general approach to the wellknown F5 algorithm for calculating
Gröbner bases, which was created by Faugère in 2002. ...
Added: October 1, 2014
Alexandrov D. E., Galkin V. V., Zobnin A.I. et al., Journal of Mathematical Sciences 2009 Vol. 163 No. 5 P. 469-486
Sequential and parallel implementations of the F4 algorithm for computing Gr¨obner bases of
polynomial ideals are discussed. ...
Added: October 1, 2014
Malyshev D., Вестник Нижегородского университета им. Н.И. Лобачевского 2008 № 6 С. 141-146
Рассматривается понятие граничного класса, которое является полезным инструментом для анализа вычислительной сложности задач на графах. Исследуются два конкретных класса графов, и приводятся задачи, для которых эти классы являются граничными. ...
Added: August 31, 2012
Revenko A., Kuznetsov S., Fundamenta Informaticae 2012 Vol. 4 No. 115 P. 377-394
An approach for studying relations between properties of functions on sets is proposed. The approach is based on Attribute Exploration. 16 properties of functions are considered, among them monotonicity, idempotency, path independence, exchange properties, convexity, etc. Example functions are partially computer generated on the powersets of sets with 2, 3 and 4 elements. Attribute Exploration ...
Added: December 31, 2012
Popkov Y., Popkov A., Dubnov Y. A., Автоматика и телемеханика 2020 № 7 С. 148-172
A randomized forecasting method based on the generation of ensembles of entropy-optimal forecasting trajectories is developed. The latter are generated by randomized dynamic regression models containing random parameters, measurement noises, and a random input. The probability density functions of random parameters and measurement noises are estimated using real data within the randomized machine learning procedure. ...
Added: October 31, 2020
Barcelona : IEEE, 2017
International Conference on Control, Decision and Information Technologies. ...
Added: January 17, 2018
МГУ, 2014
Тезисы докладов научной конференции «Ломоносовские чтения» 2013 ...
Added: December 11, 2016
Malyshev D., Дискретный анализ и исследование операций 2012 Т. 19 № 4 С. 66-72
Рассматривается конструктивный подход к формированию новых случаев эффективной разрешимости задачи о независимом множестве в семействе наследственных частей множества графов Free({P5,C5}). Именно, доказывается, что если эта задача полиномиально разрешима в классе Free({P5,C5,G}), то для любого графа H, который может быть индуктивно получен из G применением к текущему графу сложения с K1 или умножения на K1, эта ...
Added: August 31, 2012
Beklemishev L. D., Оноприенко А. А., Математический сборник 2015 Т. 206 № 9 С. 3-20
We formulate some term rewriting systems in which the number of computation steps is finite for each output, but this number cannot be bounded by a provably total computable function in Peano arithmetic PA. Thus, the termination of such systems is unprovable in PA. These systems are derived from an independent combinatorial result known as the Worm ...
Added: March 13, 2016
Malyshev D., Alekseev V., Дискретный анализ и исследование операций 2008 Т. 15 № 1 С. 3-10
Доказывается полиномиальная разрешимость задачи о независимом множестве для бесконечного семейства подмножеств класса планарных графов. ...
Added: August 31, 2012
D. V. Gribanov, D.S. Malyshev, P. M. Pardalos et al., Journal of Combinatorial Optimization 2018 Vol. 35 No. 4 P. 1128-1146
In this paper, we present fixed-parameter tractable algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems’ formulations are near square. The parameter is the maximum absolute value of the rank minors in the corresponding matrices. Additionally, we present fixed-parameter tractable algorithms ...
Added: February 19, 2018
Belomestny D., Iosipoi L., Mathematics and Computers in Simulation 2021 No. 181 P. 351-363
Markov Chain Monte Carlo methods become increasingly popular in applied mathematics as a tool for numerical integration with respect to complex and high-dimensional distributions. However, application of MCMC methods to heavy-tailed distributions and distributions with analytically intractable densities turns out to be rather problematic. In this paper, we propose a novel approach towards the use ...
Added: October 31, 2020
Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...
Added: April 7, 2014
Красноярск : ИВМ СО РАН, 2013
Труды Пятой Международной конференции «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): ...
Added: November 18, 2013
Kotelnikova M. V., Aistov A., Вестник Нижегородского университета им. Н.И. Лобачевского. Серия: Социальные науки 2019 Т. 55 № 3 С. 183-189
The article describes a method that allows to improve the content of disciplines of the mathematical cycle by dividing them into invariant (general) and variable parts. The invariants were identified for such disciplines as «Linear algebra», «Mathematical analysis», «Probability theory and mathematical statistics» delivered to Bachelors program students of economics at several universities. Based on ...
Added: January 28, 2020
Akopov A. S., Beklaryan L. A., Saghatelyan A. K., Environmental Modelling and Software 2019 Vol. 116 P. 7-25
Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...
Added: February 24, 2019
Lanham : University Press of America, 2012
The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...
Added: February 13, 2013
Sirotkin D., Malyshev D., Дискретная математика 2017 Т. 29 № 3 С. 114-125
Задача о независимом множестве для заданного обыкновенного графа состоит в вычислении размера наибольшего множества его попарно несмежных вершин. Предлагается новый способ редукции графов. С его помощью получено новое доказательство NP-полноты задачи о независимом множестве в классе планарных графов и доказана NP-полнота данной задачи в классе плоских графов, имеющих только треугольные внутренние грани, с максимальной степенью ...
Added: September 7, 2017
Feigin B. L., Finkelberg M. V., Rybnikov L. G. et al., Selecta Mathematica, New Series 2011 Vol. 17 No. 3 P. 573-607
Laumon moduli spaces are certain smooth closures of the moduli spaces of maps from the projective line to the flag variety of GLn. We construct the action of the Yangian of sln in the cohomology of Laumon spaces by certain natural correspondences. We construct the action of the affine Yangian (two-parametric deformation of the universal ...
Added: October 9, 2012
Babash A. V., М. : ИНФРА-М, РИОР, 2013
Пособие предназначено для студентов высших учебных заведений, обучающихся по специальности «Прикладная информатика (в экономике)». Оно также содержит методический материал для ряда инновационных курсов лекций по профилю «Информационная безопасность» и может быть использовано и для блока дисциплин этого профиля. Ряд представленных результатов полезен специалистам и аспирантам, специализирующихся в указанной области. ...
Added: January 14, 2014
Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Marshirov V. V., Marshirova L. E., Сибирский журнал индустриальной математики 2013 Т. XVI № 4 С. 111-120
The paper considers the problem of determining the rate of cooling of metal during solidification at the intersection of the liquidus temperature under intense heat sink from the surface. The solution to this problem it is necessary to determine the process conditions, the boundary and initial conditions for which it is possible to get new ...
Added: November 17, 2013