Related papers: The Sard problem in step 2 and in filiform Carnot …

We prove the well-posedness and regularity of solutions in mixed-norm weighted Sobolev spaces for a class of second-order parabolic and elliptic systems in divergence form in the half-space $\mathbb{R}^d_+ = \{x_d > 0\}$ subject to the…

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive $b_2$ obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions…

This paper deals with the problem of finding bi-Lipschitz behavior in non-degenerate Lipschitz maps between metric measure spaces. Specifically, we study maps from (subsets of) Ahlfors regular PI spaces into sub-Riemannian Carnot groups. We…

We introduce a new link invariant called the algebraic genus, which gives an upper bound for the topological slice genus of links. In fact, the algebraic genus is an upper bound for another version of the slice genus proposed here: the…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

The distribution of degree $d$ points on curves is well understood, especially for low degrees. We refine this study to include information on the Galois group in the simplest interesting case: $d = 3$. For curves of genus at least 5, we…

Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…

We consider sets of locally finite perimeter in Carnot groups. We show that if E is a set of locally finite perimeter in a Carnot group G, then for almost every x in G with respect to the perimeter measure of E, some tangent of E at x is a…

The classical isodiametric inequality in the Euclidean space says that balls maximize the volume among all sets with a given diameter. We consider in this paper the case of Carnot groups. We prove that for any Carnot group equipped with a…

In the setting of subFinsler Carnot groups, we consider curves that satisfy the normal equation coming from the Pontryagin Maximum Principle. We show that, unless it is constant, each such a curve leaves every compact set, quantitatively.…

We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…

A finite group $G$ admits a normal $2$-covering if there exist two proper subgroups $H$ and $K$ with $G=\bigcup_{g\in G}H^g\cup\bigcup_{g\in G}K^g$. For determining inductively the finite groups admitting a normal $2$-covering, it is…

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…

Consider a component of the Hilbert scheme whose general point corresponds to a degree d genus g smooth irreducible and nondegenerate curve in a projective variety X. We give lower bounds for the dimension of such a component when X is P^3,…

A subset of a Carnot group is said to be precisely monotone if the restriction of its characteristic function to each integral curve of every left-invariant horizontal vector field is monotone. Equivalently, a precisely monotone set is a…