English
Related papers

Related papers: There are no realizable 15_4- and 16_4-configurati…

200 papers

A complete set of inequivalent realizations of three- and four-dimensional real unsolvable Lie algebras in vector fields on a space of an arbitrary (finite) number of variables is obtained.

Mathematical Physics · Physics 2014-11-18 Maryna Nesterenko , Roman Popovych

Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

Group Theory · Mathematics 2022-01-14 Marius Tărnăuceanu

An intriguing correspondence between four-qubit systems and simple singularity of type $D_4$ is established. We first consider an algebraic variety $X$ of separable states within the projective Hilbert space…

Mathematical Physics · Physics 2015-06-18 Frédéric Holweck , Jean-Gabriel Luque , Michel Planat

For each composite number $n\ne 2^k$, there does not exist a single connected closed $(n+1)$-manifold such that any smooth, simply-connected, closed $n$-manifold can be topologically flat embedded into it. There is a single connected closed…

Geometric Topology · Mathematics 2007-05-23 Fan Ding , Shicheng Wang , Jiangang Yao

We present here a scheme that relates seemingly two different kinds of physical impossibilities of quantum information processing. We derive, exact flipping of three arbitrary states not lying in one great circle is not possible with…

Quantum Physics · Physics 2009-11-11 Indrani Chattopadhyay , Debasis Sarkar

Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we give necessary and sufficient conditions for the existence of…

Information Theory · Computer Science 2019-11-06 Zuo Ye , Tao Zhang , Xiande Zhang , Gennian Ge

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…

Rings and Algebras · Mathematics 2021-02-08 Leonard Kwuida , Claudia Mureşan

We will look for stable structures in four situations and discuss what is known and unknown.

Differential Geometry · Mathematics 2019-07-09 Tobias Holck Colding , William P. Minicozzi

We construct uncountably many discrete groups of type $FP$; in particular we construct groups of type $FP$ that do not embed in any finitely presented group. We compute the ordinary, $\ell^2$- and compactly-supported cohomology of these…

Group Theory · Mathematics 2018-04-27 Ian J. Leary

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…

Dynamical Systems · Mathematics 2024-09-04 Pablo Pedregal

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

Combinatorics · Mathematics 2023-02-15 Peter Keevash , Ashwin Sah , Mehtaab Sawhney

In this paper we consider finite 2-groups with odd number of real conjugacy classes. On one hand we show that if $k$ is an odd natural number less than 24, then there are only finitely many finite 2-groups with exactly $k$ real conjugacy…

Group Theory · Mathematics 2016-11-29 Andrei Jaikin-Zapirain , Joan Tent

We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by…

Commutative Algebra · Mathematics 2024-05-21 Tristram Bogart , Seyed Amin Seyed Fakhari

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Computational Geometry · Computer Science 2020-01-17 Stefan Felsner , Manfred Scheucher

We prove that, for any prime number $p\geq 5$, the set of natural numbers $n$ such that $p\mid H_n$ is finite.

Number Theory · Mathematics 2017-08-10 Jacopo D'Aurizio

In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from - lower and upper bounds on growth rate; in particular boundedness, - images, - regularity (recognizability by a…

Formal Languages and Automata Theory · Computer Science 2022-02-02 Daniel Krenn , Jeffrey Shallit

Let $G$ be an almost simple group. We prove that if $x \in G$ has prime order $p \ge 5$, then there exists an involution $y$ such that $<x,y>$ is not solvable. Also, if $x$ is an involution then there exist three conjugates of $x$ that…

Group Theory · Mathematics 2010-12-15 Simon Guest

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

Group Theory · Mathematics 2015-03-09 Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

Combinatorics · Mathematics 2015-10-20 Roland Bacher
‹ Prev 1 3 4 5 6 7 10 Next ›