English
Related papers

Related papers: Trivial Isomorphisms between Reduced Products

200 papers

We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…

Complex Variables · Mathematics 2019-05-30 David Joyner , Tony Shaska

The topological Tverberg theorem claims that for any continuous map of the (q-1)(d+1)-simplex to R^d there are q disjoint faces such that their images have a non-empty intersection. This has been proved for affine maps, and if $q$ is a…

Combinatorics · Mathematics 2008-02-25 Stephan Hell

We describe a general program for studying the dynamics of surjective endomorphisms of algebraic varieties that are amenable to techniques from the minimal model program. We obtain density results on the pre-periodic points of surjective…

Algebraic Geometry · Mathematics 2022-12-06 Brett Nasserden

A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…

Group Theory · Mathematics 2020-02-18 Alan McLeay

We prove that the group $\mathrm{SAut}_{\mathrm{k}}(\mathbb{A}^2)$ is simple as an algebraic group of infinite dimension, over any infinite field $\mathrm{k}$, by proving that any closed normal subgroup is either trivial or the whole group.…

Algebraic Geometry · Mathematics 2024-11-27 JérŔemy Blanc

Let $G$ be a finite or infinite graph and $m(G)$ the minimum number of vertices moved by the non-identity automorphisms of $G$. We are interested in bounds on the supremum $\Delta(G)$ of the degrees of the vertices of $G$ that assure the…

Combinatorics · Mathematics 2025-06-20 Wilfried Imrich , Rafał Kalinowski , Florian Lehner , Monika Pilśniak , Marcin Stawiski

Let $T$ be a tree with $t$ edges. We show that the number of isomorphic (labeled) copies of $T$ in a graph $G = (V,E)$ of minimum degree at least $t$ is at least \[2|E| \prod_{v \in V} (d(v) - t + 1)^{\frac{(t-1)d(v)}{2|E|}}.\]…

Combinatorics · Mathematics 2015-11-24 Dhruv Mubayi , Jacques Verstraete

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given…

Artificial Intelligence · Computer Science 2011-06-10 J. F. Baget , M. L. Mugnier

We prove a dichotomy for o-minimal fields $\mathcal{R}$, expanded by a $T$-convex valuation ring (where $T$ is the theory of $\mathcal{R}$) and a compatible monomial group. We show that if $T$ is power bounded, then this expansion of…

Logic · Mathematics 2024-12-24 Elliot Kaplan , Christoph Kesting

We use Cox's description for sheaves on toric varieties and results about the local cohomology with respect to monomial ideals to give a characteristic free approach to vanishing results on arbitrary toric varieties. As an application, we…

Algebraic Geometry · Mathematics 2007-05-23 Mircea Mustata

A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of common graphs is one of the most intriguing problems in…

Combinatorics · Mathematics 2022-04-28 Robert Hancock , Daniel Kral , Matjaz Krnc , Jan Volec

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Combinatorics · Mathematics 2023-09-12 Bernd S. W. Schröder

We develop a topological framework in an attempt to generalize the classical colourful Caratheodory theorem by imposing an additional constraint. For that we introduce the notion of zero-avoding complexes and covering criteria for the…

Algebraic Topology · Mathematics 2025-12-30 Pavle V. M. Blagojevic

In [21] it was asked if equality on the reals is sharp as a lower bound for the complexity of topological isomorphism between oligomorphic groups. We prove that under the assumption of weak elimination of imaginaries this is indeed the…

Logic · Mathematics 2024-04-09 Gianluca Paolini

Greenberg proved that every countable group $A$ is isomorphic to the automorphism group of a Riemann surface, which can be taken to be compact if $A$ is finite. We give a short and explicit algebraic proof of this for finitely generated…

Group Theory · Mathematics 2019-12-17 Gareth A. Jones

Martin's Axiom does not imply that all automorphisms of P(N)/[N]^{<aleph_0} are somewhere trivial.

Logic · Mathematics 2007-05-23 Saharon Shelah , Juris Steprāns

The central result of this paper is the small-is-very-small principle for restricted sequential theories. The principle says roughly that whenever the given theory shows that a property has a small witness, i.e. a witness in every definable…

Logic · Mathematics 2018-05-04 Albert Visser

Let $A$ be an excellent two-dimensional normal local ring containing an algebraically closed field and let $X\to \mathrm{Spec} (A)$ be a resolution of singularity. We prove a theorem giving a condition under which the dimension of the…

Algebraic Geometry · Mathematics 2025-12-16 Tomohiro Okuma , Kei-ichi Watanabe , Ken-ichi Yoshida

Let X be an irreducible smooth projective curve, of genus at least two, defined over an algebraically closed field of characteristic different from two. If X admits a nontrivial automorphism \sigma that fixes pointwise all the order two…

Algebraic Geometry · Mathematics 2008-04-11 Indranil Biswas , A. J. Parameswaran
‹ Prev 1 4 5 6 7 8 10 Next ›