共找到 20 条结果
A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.
An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E(G)$ and $\{1,2,\ldots,|E(G)|\}$ such that any two vertices have distinct vertex sums, where the vertex sum of a vertex is the sum of the labels of the in-edges minus that of the out-edges incident to the vertex. It is conjectured by Hefetz, Mütze, and Schwartz that every connected graph admits an antimagic orientation. A weak version of this problem is to require the distinct vertex sums only for the adjacent vertices. In that case, we say the graph admits a local antimagic orientation. Chang, Jing, and Wang~\cite{CJW20} conjectured that every connected graph admits a local antimagic orientation. In this paper, we give an affirmative answer to the conjecture of Chang et al., and show that almost every graph satisfies the conjecture of Hefetz et al.
We prove that every Peano continuum (a space that is a continuous image of $[0,1]$) admits a topologically mixing but not exact map. The constructed map has a dense set of periodic points.
In this paper, we have proved that for each cardinal number $λ$ such that $λ=λ^{\aleph_0}$ a metric space of weight $λ$ admits a bijective continuous mapping onto a Banach space of weight $λ$. Then, we get that every metric space of weight continuum admits a bijective continuous mapping onto the Hilbert cube. This resolves the famous Banach's Problem (when does a metric (possibly Banach) space $X$ admit a bijective continuous mapping onto a compact metric space?) in the class of metric spaces of weight continuum. Also we get that every metric space of weight $λ=λ^{\aleph_0}$ admits a bijective continuous mapping onto a Hausdorff compact space. This resolves the Alexandroff Problem (when does a Hausdorff space $X$ admit a bijective continuous mapping onto a Hausdorff compact space?) in the class of metric spaces of weight $λ=λ^{\aleph_0}$.
Given an undirected graph $G$ and a parameter $k$, the $k$-Leaf Spanning Tree ($k$-LST) problem asks if $G$ contains a spanning tree with at least $k$ leaves. This problem has been extensively studied over the past three decades. In 2000, Fellows et al. [FSTTCS'00] explicitly asked whether it admits a klam value of 50. A steady progress towards an affirmative answer continued until 5 years ago, when an algorithm of klam value 37 was discovered. In this paper, we present an $O^*(3.188^k)$-time parameterized algorithm for $k$-LST, which shows that the problem admits a klam value of 39. Our algorithm is based on an interesting application of the well-known bounded search trees technique, where the correctness of rules crucially depends on the history of previously applied rules in a non-standard manner.
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears with exponents that are all positive, or all negative. This is the ground result for ordering braids. In this paper, we enhance this result and prove that every braid admits a sigma-definite word representative that, in addition, is quasi-geodesic. This establishes a longstanding conjecture. Our proof uses the dual braid monoid and a new normal form called the rotating normal form.
Let $g_S$ be the Simanca metric on the blow-up $\tilde{\mathbb{C}}^2$ of $\mathbb{C}^2$ at the origin. We show that $(\tilde{\mathbb{C}}^2,g_S)$ admits a regular quantization. We use this fact to prove that all coefficients in the Tian-Yau-Zelditch expansion for the Simanca metric vanish and that a dense subset of $(\tilde{\mathbb{C}}^2, g_S)$ admits a Berezin quantization
In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeration, counting and uniform generation of solutions, and show that they have several desirable properties in this respect. Both complexity classes are defined in terms of non-deterministic logspace transducers (NL transducers). For the first class, we consider the case of unambiguous NL transducers, and we prove constant delay enumeration, and both counting and uniform generation of solutions in polynomial time. For the second class, we consider unrestricted NL transducers, and we obtain polynomial delay enumeration, approximate counting in polynomial time, and polynomial-time randomized algorithms for uniform generation. More specifically, we show that each problem in this second class admits a fully polynomial-time randomized approximation scheme (FPRAS) and a polynomial-time Las Vegas algorithm for uniform generation. Interestingly, the key idea to
We prove that every quasitoric manifold admits an invariant metric of positive scalar curvature.
We show that if an automorphism of a standard Borel space does not admit finite invariant measures, then it has a two-set generator modulo the sigma-ideal generated by wandering sets. This implies that if the entropies of invariant probability measures of a Borel system are all less than log(k), then the system admits a k-set generator, and that a wide class of hyperbolic-like systems are classified completely at the Borel level by entropy and periodic points counts.
In this paper we give a partial answer to a 1980 question of Lazslo Babai: "Which [finite] groups admit an oriented graph as a DRR?" That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite non-solvable group admits an ORR, and provide a tool that may prove useful in showing that some families of finite solvable groups admit ORRs. We also completely characterize all finite groups that can be generated by at most three elements, according to whether or not they admit ORRs.
Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.
We classify the Artin groups that admit retractions onto all of their parabolic subgroups. Our approach relies on a detailed analysis of triangular subgroups, with a key ingredient being the classification of homomorphisms between dihedral Artin groups that map one of the standard generators to a standard generator. As a consequence, we show that whenever an Artin group admits retractions to parabolic subgroups, it also admits ordinary ones - that is, retractions that send each standard generator either to a standard generator or to the identity.
A temporal graph is a graph in which every edge carries a non-empty set of time labels, and it is temporally connected if for every two vertices $u$ and $v$, there exists a $u$-$v$-path with non-decreasing time labels. A spanner is a subset of its edges preserving temporal connectivity. Unlike static graphs, temporally connected graphs need not admit sparse spanners; nonetheless, minimizing spanner size is a central and widely studied problem. A particularly intriguing question is whether temporal cliques admit spanners of linear size. Despite considerable effort over the past years, the best known upper bound remained $O(n \log n)$. We finally resolve this question, proving that every temporal clique on $n$ vertices admits a spanner of size $7n$. Moreover, such a spanner can be computed in polynomial time.
Let $\mathcal{A}$ be an algebra, and let $\mathcal{A}^2 =$ span$\{ab : a, b \in \mathcal{A}\}$ be a subalgebra of $\mathcal{A}$. In this paper, we prove that if $\mathcal{A}^2$ has infinite codimension in $\mathcal{A}$ iff $\mathcal{A}$ has discontinuous square annihilation property (DSAP). In fact, in this case, the algebra $\mathcal{A}$ admits infinitely many non-equivalent algebra norms.
For a positive integer $m$, a finite group $G$ is said to admit a tournament $m$-semiregular representation (TmSR for short) if there exists a tournament $Γ$ such that the automorphism group of $Γ$ is isomorphic to $G$ and acts semiregularly on the vertex set of $Γ$ with $m$ orbits. Clearly, every finite group of even order does not admit a TmSR for any positive integer $m$, and T1SR is the well-known tournament regular representation (TRR for short). In 1986, Godsil \cite{god} proved, by a probabilistic approach, that the only finite groups of odd order without a TRR are $\mathbb{Z}_3^2$ and $\mathbb{Z}_3^3$ . More recently, Du \cite{du} proved that every finite group of odd order has a TmSR for every $m \geq 2$. The author of \cite{du} observed that a finite group of odd order has no regular TmSR when $m$ is an even integer, a group of order $1$ has no regular T3SR, and $\mathbb{Z}_3^2$ admits a regular T3SR. At the end of \cite{du}, Du proposed the following problem. oindent{\sf\it Problem.} \ \ {\it For every odd integer $m\geq 3$, classify finite groups of odd order which have a regular TmSR.} The motivation of this paper is to give an answer for the above problem. We proved
It is a classical result of Kaimanovich and Vershik and independently of Rosenblatt that a non-amenable group admits a non-degenerate symmetric measure such that the Poisson boundary is trivial. Most if not all examples to date of non-free actions of countable groups on their Poisson boundaries had the stabilizers sitting inside the amenable radical. We show that every countable non-C*-simple group admits a symmetric measure of full support with non-trivial stabilizers. For a class of non-C*-simple groups with trivial amenable radical, which is non-empty as was shown by le Boudec, this gives a wealth of examples with non-normal stabilizers.
The aim of this paper is to classify all real and complex 3-dimensional Lie algebras admitting regular semisimple algebraic Nijenhuis operators. This problem is completely solved (see Theorems 2 and 3) by describing all Nijenhuis eigenbases for each 3-dimensional Lie algebra. It turns out that the answer is different in real and complex cases in the sence that there are real Lie algebras such that they do not admit an algebraic Nijenhuis operator, but their complexification admits such operators. An equally interesting question is to describe all algebraic Nijenhuis operators which are not equivalent by an automorphism of the Lie algebra. We give an answer to this question for some Lie algebras.
We prove several conjectures relating the existence of nonvanishing 1- forms to smooth morphisms over abelian varieties, assuming the existence of good minimal models. The proof involves a decomposition result for a family of Calabi-Yau varieties equipped with a surjective map to an abelian scheme. In the uniruled case, supposing the MRC base admits a good minimal model, we also achieve a structure theorem for those varieties admitting nowhere vanishing 1-forms.
We prove the statement in the title: if a (finite) unital admits all translations and contains no O'Nan configurations then the unital is classical, i.e., isomorphic to the Hermitian unital of the same order.