?
Collineation group as a subgroup of the symmetric group
Central European Journal of Mathematics. 2013. Vol. 11. No. 1. P. 17-26.
Let Ψ be the projectivization (i.e., the set of one-dimensional vector subspaces) of a vector space of dimension ≥ 3 over a field. Let H be a closed (in the pointwise convergence topology) subgroup of the permutation group GΨ of the set Ψ. Suppose that H contains the projective group and an arbitrary self-bijection of Ψ transforming a triple of collinear points to a non-collinear triple. It is well-known from [9] that if Ψ is finite then H contains the alternating subgroup AΨ of GΨ.
We show in Theorem 3.1 below that H = GΨ, if Ψ is infinite.
Research target:
Mathematics
Language:
English
Fedor Bogomolov, Rovinsky M., / Cornell University. Series math "arxiv.org". 2012.
Let $\Psi$ be the projectivization (i.e., the set of one-dimensional vector
subspaces) of a vector space of dimension $\ge 3$ over a field. Let $H$ be a
closed (in the pointwise convergence topology) subgroup of the permutation
group $\mathfrak{S}_{\Psi}$ of the set $\Psi$. Suppose that $H$ contains the
projective group and an arbitrary self-bijection of $\Psi$ transforming a
triple of ...
Added: November 21, 2014
Bogomolov F. A., Kulikov V. S., Central European Journal of Mathematics 2013 Vol. 11 No. 2 P. 254-263
The article contains a new proof that the Hilbert scheme of irreducible surfaces of degree m in ℙ m+1 is irreducible except m = 4. In the case m = 4 the Hilbert scheme consists of two irreducible components explicitly described in the article. The main idea of our approach is to use the proof ...
Added: November 21, 2012
М. : МАКС Пресс, 2015
The collection represents proceedings of the nineth international conference "Discrete Models in Control Systems Theory" that is held by Lomonosov Moscow State Uneversity and is dedicated in 90th anniversary of Sergey Vsevolodovich Yablonsky's birth. The conference subject are includes: discrete functional systems; discrete functions properties; control systems synthesis, complexity, reliability, and diagnostics; automata; graph theory; ...
Added: March 28, 2015
М. : МАКС Пресс, 2017
The collection represents proceedings of the XVIII international conference “Problems of Theoretical Cybernetics” (Penza, 19–23 June, 2017), that is sponsored by Russian Foundation for Basic Research (project N 17-01-20217-г). The conference subject area includes: control systems synthesis, complexity, reliability, and diagnostics; automata; computer languages and programming; graph theory; combinatorics; coding theory; theory of pattern recognition; ...
Added: September 21, 2017
Pham S. K., Antipov D., Sirotkin Alexander et al., Journal of Computational Biology 2013 Vol. 20 No. 4 P. 359-371
One of the key advances in genome assembly that has led to a significant improvement in contig lengths has been improved algorithms for utilization of paired reads (mate-pairs). While in most assemblers, mate-pair information is used in a post-processing step, the recently proposed Paired de Bruijn Graph (PDBG) approach incorporates the mate-pair information directly in ...
Added: March 21, 2014
Prokhorov Y., Journal of Algebraic Geometry 2012 Vol. 21 No. 3 P. 563-600
We classify all finite simple subgroups of the Cremona group Cr3(C). ...
Added: September 19, 2012
Akhtar M., Coates T., Galkin S. et al., / Cornell University. Series math "arxiv.org". 2012. No. 1212.1785.
Given a Laurent polynomial f, one can form the period of f: this is a function of one complex variable that plays an important role in mirror symmetry for Fano manifolds. Mutations are a particular class of birational transformations acting on Laurent polynomials in two variables; they preserve the period and are closely connected with ...
Added: September 14, 2013
Старичкова Ю. В., Neznanov A., Бизнес-информатика 2011 № 3 С. 36-44
Описывается оригинальный программный комплекс для генерации бесконечных и конечных семейств связных транзитивных графов степени 4, полностью покрывающих все известные графы до 30 вершин. Отличительной особенностью разработки является многокритериальная каталогизация семейств на основе характеристик симметрии, структурной сложности и визуализации симметричных диаграмм. Комплекс расширяет функциональные возможности АСНИ «Graph Model Workshop» и позволяет решать задачи, требующие синтеза транзитивных ...
Added: September 11, 2012
М. : Изд-во механико-математического факультета МГУ, 2019
Сборник содержит материалы XII Международного семинара «Дискретная математика и ее приложения» имени академика О.Б. Лупанова, проходившего на механико-математическом факультете МГУ имени М. В. Ломоносова с 17 по 22 июня 2019 г. при поддержке Российского фонда фундаментальных исследований (проект 16–01–20345). Семинар охватывает следующие направления в области дискретной математики: теория функциональных систем, синтез, сложность и надежность управляющих ...
Added: October 17, 2019
NY : Springer, 2013
This volume contains a selection of contributions from the "First International Conference in Network Analysis," held at the University of Florida, Gainesville, on December 14-16, 2011. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The ...
Added: December 19, 2012
Shitov Y., Journal of Algebra 2012 Vol. 370 P. 1-4
The paper gives a complete description of the subgroups of the semigroup of tropical n-by-n matrices up to an isomorphism. ...
Added: November 7, 2012
Vikentyeva O., Morozenko V. V., Plotnikova E. G. et al., Пермь : ИЦ «Титул», 2020
Данный учебник и практикум представляет основные разделы дисциплины «Дискретная математика»: множества, комбинаторика, графы. Учебник и практикум содержит необходимый теоретический материал, излагаемый в доступной форме и иллюстрированный большим количеством примеров, а также разнообразные по содержанию и сложности задания для самостоятельного решения.
Учебник и практикум подготовлен на основе многолетнего опыта работы авторов и апробирован на практических занятиях в ...
Added: November 16, 2020
Braverman A., Michael Finkelberg, / Cornell University. Series math "arxiv.org". 2014.
In this note, we extend the results of arxiv:1111.2266 and arxiv:1203.1583 to the non simply laced case. To this end we introduce and study the twisted zastava spaces. ...
Added: February 5, 2015
Vassiliev V., Труды Математического института им. В.А. Стеклова РАН 2015 Т. 290 С. 211-225
The naturally topologized order complex of proper algebraic subsets in RP^2, defined by systems of quadratic forms, has rational homology of S^13. ...
Added: January 19, 2016
Старичкова Ю. В., Neznanov A., Вестник Тамбовского университета. Серия: Естественные и технические науки 2012 Т. 17 № 2 С. 532-547
Рассматривается задача классификации семейств связных транзитивных графов степени 4 (ТГС4) на основе характеристик симметрии (строения группы автоморфизмов) и информации обо всех ТГС4 с числом вершин до 30. Предлагается один из вариантов классификации и конкретные бесконечные и конечные семейства, покрывающие все ТГС4 до 30 вершин, с возможностью расширения состава семейств с ростом числа вершин ТГС4. Построен ...
Added: September 11, 2012
М. : МАКС Пресс, 2017
The collection represents proceedings of the XVIII international conference “Problems of Theoretical Cybernetics” (Penza, 19–23 June, 2017), that is sponsored by Russian Foundation for Basic Research (project N 17-01-20217-г). The conference subject area includes: control systems synthesis, complexity, reliability, and diagnostics; automata; computer languages and programming; graph theory; combinatorics; coding theory; theory of pattern recognition; ...
Added: August 25, 2017
Bezrukavnikov R., Finkelberg M. V., / Cornell University. Series math "arxiv.org". 2012. No. 1208.3696.
Mark Haiman has reduced Macdonald positivity conjecture to a statement about geometry of the Hilbert scheme of points on the plane, and formulated a generalization of the conjectures where the symmetric group is replaced by the wreath product $S_n\ltimes (Z/r Z)^n$. He has proven the original conjecture by establishing the geometric statement about the Hilbert ...
Added: February 6, 2013
F. A. Bogomolov, Vik. S. Kulikov, European Journal of Mathematics 2015 Vol. 1 No. 4 P. 260-278
In \cite{Ku0}, the ambiguity index $a_{(G,O)}$ was introduced for each equipped finite group $(G,O)$. It is equal to the number of connected components of a Hurwitz space parametrizing coverings of a projective line with Galois group $G$ assuming that all local monodromies belong to conjugacy classes $O$ in $G$ and the number of branch points ...
Added: November 21, 2014
М. : ЦЭМИ РАН, 2011
Conference covers both fundamental problems ofthe theory, and application to research of complex organizational and technical systems. ...
Added: June 6, 2013
F.A. Bogomolov, Vik.S. Kulikov, / Cornell University. Series math "arxiv.org". 2014.
In \cite{Ku0}, the ambiguity index $a_{(G,O)}$ was introduced for each
equipped finite group $(G,O)$. It is equal to the number of connected
components of a Hurwitz space parametrizing coverings of a projective line with
Galois group $G$ assuming that all local monodromies belong to conjugacy
classes $O$ in $G$ and the number of branch points is greater than some
constant. ...
Added: November 21, 2014
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
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
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
Yasnitsky L., Пермь : Пермский государственный национальный исследовательский университет. – Электронные данные. , 2020
The collection contains materials from the international conference "Intelligent systems in science and technology" and the Sixth all-Russian scientific and practical conference "Artificial intelligence in solving urgent social and economic problems of the XXI century", which was held on October 12-18, 2020 in Perm as part of the Perm natural science forum "Mathematics and global ...
Added: December 4, 2020