English
Related papers

Related papers: Regular maps of order $2$-powers

200 papers

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified

Combinatorics · Mathematics 2021-08-11 Mohsen Ghasemi , Rezvan Varmazyar

An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…

Combinatorics · Mathematics 2025-10-01 Viktor A. Byzov , Igor A. Pushkarev

This paper concerns various models of ``at-most-$n$-valued maps''. That is, multivalued maps $f:X\multimap Y$ for which $f(x)$ has cardinality at most $n$ for each $x$. We consider 4 classes of such maps which have appeared in the…

General Topology · Mathematics 2025-02-28 Daciberg Lima Goncalves , Robert Skiba , P. Christopher Staecker

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

Combinatorics · Mathematics 2025-04-29 Yanhong Zhu , Kai Yuan

Let $G$ be a graph of order $n$. The path decomposition of $G$ is a set of disjoint paths, say $\mathcal{P}$, which cover all vertices of $G$. If all paths are induced paths in $G$, then we say $\mathcal{P}$ is an induced path decomposition…

Combinatorics · Mathematics 2019-12-03 S. Akbari , H. R. Maimani , A. Seify

Cohn--Conway--Elkies--Kumar [Experiment. Math. (2007)] described that one can construct a family of designs on $S^{2n-1}$ from a design on $\mathbb{CP}^{n-1}$. In this paper, we prove their claim for the case where $n=2$. That is, we give…

Metric Geometry · Mathematics 2015-06-30 Takayuki Okuda

In this paper, we give a characterization of the normal subgroups of index $2^{s}(2n+1),\ s\in\{1,2\},\ n\in \mathbb{N}$ and of the subgroups of index three of the group representation of the Cayley tree.

Group Theory · Mathematics 2016-01-14 F. H. Haydarov

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…

Combinatorics · Mathematics 2017-09-12 Evgeniy Krasko , Alexander Omelchenko

For a two parameter family of two-dimensional piecewise linear maps and for every natural number $ n $ we prove not only the existence of intervals of parameters for which the respective maps are $ n $ times renormalizable but also we show…

Dynamical Systems · Mathematics 2017-03-14 Antonio Pumariño , José Ángel Rodríguez , Enrique Vigil

We study the Sard problem for the endpoint map in some well-known classes of Carnot groups. Our first main result deals with step 2 Carnot groups, where we provide lower bounds (depending only on the algebra of the group) on the codimension…

Differential Geometry · Mathematics 2022-03-31 Francesco Boarotto , Luca Nalon , Davide Vittone

We provide new examples of integrable rational maps in four dimensions with two rational invariants, which have unexpected geometric properties, as for example orbits confined to non algebraic varieties, and fall outside classes studied by…

Exactly Solvable and Integrable Systems · Physics 2018-11-06 N. Joshi , CM. Viallet

Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…

General Topology · Mathematics 2023-06-27 Raushan Buzyakova

The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$…

Computational Geometry · Computer Science 2013-11-06 Greg Aloupis , John Iacono , Stefan Langerman , Özgür Özkan

We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work…

Quantum Physics · Physics 2026-04-13 Anna Jenčová

In this work we classify the at-point regularities of set-valued mappings into two categories and then we analyze their relationship through several implications and examples. After this theoretical tour, we use the subregularity properties…

Optimization and Control · Mathematics 2012-02-07 Marius Apetrii , Marius Durea , Radu Strugariu

For a maximal outerplanar graph $G$ of order $n$ at least $3$, Matheson and Tarjan showed that $G$ has domination number at most $n/3$. Similarly, for a maximal outerplanar graph $G$ of order $n$ at least $5$, Dorfling, Hattingh, and Jonck…

Combinatorics · Mathematics 2015-11-30 José D. Alvarado , Simone Dantas , Dieter Rautenbach

We consider a generalized Baernstein space associated to a compact family of finite subsets of an uncountable set. We show that for certain transfinitely defined families such spaces admit an equivalent $2$-rotund norm. We also show that…

Functional Analysis · Mathematics 2023-11-29 S. J. Dilworth , Denka Kutzarova

Let $S$ be the collection of quadratic polynomial maps, and degree $2$-rational maps whose automorphism groups are isomorphic to $C_2$ defined over the rational field. Assuming standard conjectures of Poonen and Manes on the period length…

Dynamical Systems · Mathematics 2022-06-09 Burcu Barsakçı , Mohammad Sadek

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…

Combinatorics · Mathematics 2014-09-25 Abbas Seify , Hossein Shahmohamad

Let $F$ and $G$ be simple finite oriented graphs (without symmetric arcs). A graph $G$ is called $F$-irregular if any two distinct vertices in $G$ belong to a different number of subgraphs of $G$ isomorphic to $F$. In this paper, we…

Combinatorics · Mathematics 2026-05-22 Tatiana Dovzhenok , Ilya Lukashenko , Yahor Filiuta
‹ Prev 1 3 4 5 6 7 10 Next ›