English
Related papers

Related papers: Strongly incompressible curves

200 papers

Fix a finite group $G$. We seek to classify varieties with $G$-action equivariantly birational to a representation of $G$ on affine or projective space. Our focus is odd-dimensional smooth complete intersections of two quadrics, relating…

Algebraic Geometry · Mathematics 2022-02-02 Brendan Hassett , Yuri Tschinkel

A graph $G$ is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.

Combinatorics · Mathematics 2020-12-14 Houmem Belkhechine

The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…

Group Theory · Mathematics 2014-04-04 Istvan Kovacs , Aleksander Malnic , Dragan Marusic , Stefko Miklavic

We introduce equivariant versions of uniform rationality: given an algebraic group G, a G-variety is called G-uniformly rational (resp. G-linearly uniformly rational) if every point has a G-invariant open neighborhood equivariantly…

Algebraic Geometry · Mathematics 2017-03-28 Charlie Petitjean

We construct a $C^1$ symplectic twist map f of the annulus that has an essential invariant curve C such that: --C is not differentiable; -- the dynamic of f restricted to C is conjugated to the one of a Denjoy counter-example.

Dynamical Systems · Mathematics 2012-04-27 Marie-Claude Arnaud

In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…

Algebraic Topology · Mathematics 2014-01-17 Lukáš Vokřínek

We study $G$-equivariant birational geometry of toric varieties, where $G$ is a finite group.

Algebraic Geometry · Mathematics 2021-12-10 Andrew Kresch , Yuri Tschinkel

Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the asymptotic structure of graphs represented by…

Combinatorics · Mathematics 2020-07-29 Daniel Kral , László Miklós Lovász , Jonathan A. Noel , Jakub Sosnovec

We prove the following generalization of Severi's Theorem: Let $X$ be a fixed complex variety. Then there exist, up to birational equivalence, only finitely many complex varieties $Y$ of general type of dimension at most three which admit a…

alg-geom · Mathematics 2014-12-02 Gerd Dethloff

The proper subgroup $B$ of the group $G$ is called {\it strongly embedded}, if $2\in\pi(B)$ and $2\notin\pi(B \cap B^g)$ for any element $g \in G \setminus B $ and, therefore, $ N_G(X) \leq B$ for any 2-subgroup $ X \leq B $. An element $a$…

Group Theory · Mathematics 2020-04-30 Anatoliy Sozutov

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…

Group Theory · Mathematics 2019-02-08 Andre Nies

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

Combinatorics · Mathematics 2023-02-20 Csilla Bujtás , Nima Ghanbari , Sandi Klavžar

The canonical double cover $B(X)$ of a graph $X$ is the direct product of $X$ and $K_2$. If $Aut(B(X)) \cong Aut(X) \times \mathbb{Z}_2$ then $X$ is called stable; otherwise $X$ is called unstable. An unstable graph is nontrivially unstable…

Combinatorics · Mathematics 2022-01-11 Blas Fernandez , Ademir Hujdurović

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

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Group Theory · Mathematics 2018-09-28 Zeinab Akhlaghi , Carlo Casolo , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

A graph $G = (V,E)$ is called equistable if there exist a positive integer $t$ and a weight function $w : V \to \mathbb{N}$ such that $S \subseteq V$ is a maximal stable set of $G$ if and only if $w(S) = t$. Such a function $w$ is called an…

Data Structures and Algorithms · Computer Science 2015-03-04 Eun Jung Kim , Martin Milanic , Oliver Schaudt

We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it…

Logic · Mathematics 2024-04-09 Yatir Halevi , Assaf Hasson , Ya'acov Peterzil

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Combinatorics · Mathematics 2023-11-17 Maria Chudnovsky , Daniel Cizma , Nati Linial

We obtained some sufficient and necessary conditions of existence of faithful irreducible representations of a soluble group $G$ of finite rank over a field $k$. It was shown that the existence of such representations strongly depends on…

Group Theory · Mathematics 2012-08-14 A. V. Tushev

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

Computational Complexity · Computer Science 2017-10-17 Mikhail Tikhomirov
‹ Prev 1 8 9 10 Next ›