中文
相关论文

相关论文: On 3 and 4 dimensional regular solids, Part 1: The…

200 篇论文

Let $\mathcal{M}$ be a finite von Neumann algebra and $u_1,\dots,u_N$ be unitaries in $\mathcal{M}$. We show that $u_1,\dots,u_N$ freely generate $L(\mathbb{F}_N)$ if and only if $$\left\|\sum_{i=1}^N u_i \otimes (u_i^{\mathrm{op}})^* +…

算子代数 · 数学 2023-10-25 Léonard Cadilhac , Benoit Collins

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

群论 · 数学 2017-11-02 Christian Lange , Marina A. Mikhailova

Elements of the commutator subgroup of a free group can be presented as values of canonical forms, called Wicks forms. We show that, starting from sufficiently high genus g, there is a sequence of words w(g) which can be presented by f(g)…

群论 · 数学 2012-11-14 Andrew Duncan , Alina Vdovina

We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…

群论 · 数学 2023-12-22 Wajid Mannan

In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…

代数几何 · 数学 2007-05-23 Alessandra Sarti

We enumerate all ternary length-l square-free words, which are words avoiding squares of words up to length l, for l<=24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds…

组合数学 · 数学 2007-05-23 Christoph Richard , Uwe Grimm

We construct a simple invariant of free link valued in a certain group by using parity.

几何拓扑 · 数学 2010-02-03 Vassily Olegovich Manturov , Oleg Vassilievich Manturov

We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…

群论 · 数学 2023-08-31 Henry Bradford , Jakob Schneider , Andreas Thom

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

组合数学 · 数学 2007-05-23 Svetoslav Savchev , Fang Chen

A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…

组合数学 · 数学 2024-04-26 Georg Grasegger , Jan Legerský

We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…

组合数学 · 数学 2018-10-08 Dean Crnkovic , Sanja Rukavina , Andrea Svob

In the picture-hanging puzzle we are to hang a picture so that the string loops around $n$ nails and the removal of any nail results in a fall of the picture. We show that the length of a sequence representing an element in the free group…

组合数学 · 数学 2018-12-20 Radoslav Fulek , Sergey Avvakumov

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

逻辑 · 数学 2017-08-03 Almudena Colacito , George Metcalfe

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

形式语言与自动机理论 · 计算机科学 2022-09-08 L. Schaeffer , J. Shallit

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

群论 · 数学 2020-09-22 Vitaly Roman'kov

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

群论 · 数学 2026-04-10 Angsuman Das , Hiranya Kishore Dey , Khyati Sharma

Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14,…

形式语言与自动机理论 · 计算机科学 2010-10-26 Arseny M. Shur

To each 4x4 matrix of reals another 4x4 matrix is constructed, the so-called associate matrix. This associate matrix is shown to have rank 1 and norm 1 (considered as a 16D vector) if and only if the original matrix is a 4D rotation matrix.…

综合数学 · 数学 2007-05-23 Johan Ernest Mebius

For any simplicial complex $X$ with a total ordering of its vertices, one can construct a chain complex $\mathbb{L}_\bullet(X)$ generated by necklaces of simplices in $X$, which computes the homology of the free loop space of the geometric…

代数拓扑 · 数学 2025-10-01 Luis Fernandez , Manuel Rivera , Thomas Tradler

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

群论 · 数学 2014-05-14 Tomasz Odrzygóźdź