Related papers: ODE trajectories as abnormal curves in Carnot grou…
Many important problems in extremal combinatorics can be be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
The distortion of a curve is the supremum, taken over distinct pairs of points of the curve, of the ratio of arclength to spatial distance between the points. Gromov asked in 1981 whether a curve in every knot type can be constructed with…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
Each irreducible representation of the motion group of the plane has a unique maximal inductive algebra, and it is self adjoint.
We develop a graphical representation of polynomial invariants of unitary gauge groups, and use it to find the algebraic curve corresponding to a hyperkahler quotient of a linear space. We apply this method to four dimensional ALE spaces,…
We study the problem of $d$-gonality of the modular curve $X_0(N)$. As a result, we can give an upperbound of the level $N$ by means of $d$. This generalizes Ogg's result on hyperelliptic modular curves ($d = 2$). As a corollary of this…
A classical fact is that through any $d+3$ general points in $\mathbb{P}_\mathbb{C}^d$ there exists a unique rational normal curve of degree $d$ passing through them. We generalize this by proving the following: when $n$ is odd, for any…
We give a construction of direct limits in the category of complete metric scalable groups and provide sufficient conditions for the limit to be an infinite-dimensional Carnot group. We also prove a Rademacher-type theorem for such limits.
It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…
We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic…
The main object of study of this paper is the notion of a LieDer pair, i.e. a Lie algebra with a derivation. We introduce the concept of a representation of a LieDer pair and study the corresponding cohomologies. We show that a LieDer pair…
We give a unified proof of the existence of turbulence for some classes of continuous interval maps which include, among other things, maps with periodic points of odd periods > 1, some maps with dense chain recurrent points and densely…
We prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and $k\equiv |E(G)|\pmod{2}$. We conjecture that a connected…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
We give a stack-theoretic proof for some results on families of hyperelliptic curves.
We construct a connection and a curving on a bundle gerbe associated with lifting a structure group of a principal bundle to a central extension. The construction is based on certain structures on the bundle, i.e. connections and…
We classify invariant curves for birational surface maps that are expanding on cohomology. When the expansion is exponential, the arithmetic genus of an invariant curve is at most one. This implies severe constraints on both the type and…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…