相关论文: A remark on the construction of centric linking sy…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

Let $\mathscr{C}$ be a classical group defined over a finite field. We present comprehensive theoretical solutions to the following closely related problems: 1) List a representative for each conjugacy class of $\mathscr{C}$. 2) Given $x…

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…

We characterize the symbolical dynamical systems which are topologically isomorphic to the Fibonacci dynmaical system. We prove that there are infinitely many injective primitive substitutions generating a dynamical system in the Fibonacci…

In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.

We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some…

Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and…

The number of peaks of a random permutation is known to be asymptotically normal. We give a new proof of this and prove a central limit theorem for the distribution of peaks in a fixed conjugacy class of the symmetric group. Our technique…

In this article we prove that for any saturated fusion system, that the (unique) smallest weakly normal subsystem of it on a given strongly closed subgroup is actually normal. This has a variety of corollaries, such as the statement that…

A central question for causal inference is to decide whether a set of correlations fit a given causal structure. In general, this decision problem is computationally infeasible and hence several approaches have emerged that look for…

In this paper we extend categorically the notion of a finite nilpotent group to fusion categories. To this end, we first analyze the trivial component of the universal grading of a fusion category C, and then introduce the upper central…

We develop the theory of the intertwining distributional versions of the LS-category and the sequential topological complexities of a space $X$, denoted by $\mathsf{icat}(X)$ and $\mathsf{iTC}_m(X)$, respectively. We prove that they satisfy…

Let G be a group. Two elements x and y in G are said to be in the same z-class if their centralizers in G are conjugate within G. In this paper, we prove that the number of z-classes in the group of upper triangular matrices is infinite…

The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typically store only a small subset of the data. In this paper,…

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

We characterize the group property of being with infinite conjugacy classes (or icc, in which all conjugacy classes beside 1 are infinite) for extensions of some specific groups ; namely extensions of abelian, centerless, icc, or word…

Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…

We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy class.Additionally, we prove that the limiting variance is…