Related papers: There are no iterated morphisms that define the Ar…

We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…

The size $b$ of the smallest bidirectional macro scheme, which is arguably the most general copy-paste scheme to generate a given sequence, is considered to be the strictest reachable measure of repetitiveness. It is strictly lower-bounded…

In this paper, we prove that the maximal order of a semiregular element in the automorphism group of a cubic vertex-transitive graph X does not tend to infinity as the number of vertices of X tends to infinity. This gives a solution (in the…

We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO-arrays.…

We develop formulas that define permutahedral commutation coherence relations of all orders. To illustrate the result geometrically, we begin by defining a rigid transformation of the $(n+1)$-permutahedron into a $n$-cube of dimensions $1…

To each second-order ordinary differential equation $\sigma $ on a smooth manifold $M$ a $G$-structure $P^\sigma $ on $J^1(\mathbb{R},M)$ is associated and the Chern connection $\nabla ^\sigma $ attached to $\sigma $ is proved to be…

We prove that the bounded derived category of the surface S constructed by Barlow admits a length 11 exceptional sequence consisting of (explicit) line bundles. Moreover, we show that in a small neighbourhood of S in the moduli space of…

Let F_n be the free group on n generators, and P\Sigma_n be the group of automorphisms of F_n which send each generator to a conjugate of itself. Let K_n be the kernel of the homomorphism from P\Sigma_n to P\Sigma_{n-1} induced by mapping…

We study dipole Chern-Simons theory with and without a cosmological constant in $2+1$ dimensions. We write the theory in a second order formulation and show that this leads to a fracton gauge theory coupled to Aristotelian geometry which…

We construct families of birational involutions on $\mathbb{P}^3$ or a smooth cubic threefold which do not fit into a non-trivial elementary relation of Sarkisov links. As a consequence, we construct new homomorphisms from their group of…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for graphs of bounded treewidth. Unfortunately, the running time's dependence on…

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

We deform monomial space curves in order to construct examples of set-theoretical complete intersection space curve singularities. As a by-product we describe an inverse to Herzog's construction of minimal generators of non-complete…

Suppose that f is a projective birational morphism with at most one-dimensional fibres between d-dimensional varieties X and Y, satisfying ${\bf R}f_* \mathcal{O}_X = \mathcal{O}_Y$. Consider the locus L in Y over which f is not an…

A theorem of Y. Berest, P. Etingof and V. Ginzburg states that finite dimensional irreducible representations of a type A rational Cherednik algebra are classified by one rational number m/n. Every such representation is a representation of…

In this paper, we prove that the self-dual morphological hierarchical structure computed on a n-D gray-level wellcomposed image u by the algorithm of G{\'e}raud et al. [1] is exactly the mathematical structure defined to be the tree of…

A sequence of nonnegative integers \pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \pi. In this case, G is said to realize or be a realization of \pi. Degree sequence results in the literature generally…

For a curve $X$ of genus $>1$ defined over a finite field, we present a criterion which allows us to state the non existence of automorphisms of order a power of a rational prime. We show how this criterion can be used to determine the…