Related papers: Algebraic realization of stable Poincar\'e-Reeb gr…
In a prior paper the authors obtained a four-dimensional discrete integrable dynamical system by the traveling wave reduction from the lattice super-KdV equation in a case of finitely generated Grassmann algebra. The system is a coupling of…
The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…
We prove that the radii of convergence of the solutions of a $p$-adic differential equation $\mathcal{F}$ over an affinoid domain $X$ of the Berkovich affine line are continuous functions on $X$ that factorize through the retraction of…
Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued,…
Let $(\mathfrak{g},[p])$ be a finite dimensional restricted Lie algebra over a perfect field $\mathbbm{k}$ of characteristic $p\!\ge \!3$. By combining methods from recent work of Benson-Carlson \cite{BC20} with those of \cite{CF21,Fa17} we…
We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
The Reeb graph of a smooth function is a graph being a natural quotient space of the manifold of the domain and the space of all connected components of preimages. Such a combinatorial and topological object roughly and compactly represents…
We present a geometric formula of Poincar\'e type, which is inspired by a classical work of Sternberg and Zumbrun, and we provide a classification result of stable solutions of linear elliptic problems with nonlinear Robin conditions on…
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…
Consider a simple algebraic group $G$ of classical type and its Lie algebra $\mathfrak{g}$. Let $(e,h,f) \subset \mathfrak{g}$ be an $\mathfrak{sl}_2$-triple and $Q_e= C_G(e,h,f)$. The torus $T_e$ that comes from the…
We describe the set of all Dirichlet forms associated to a given infinite graph in terms of Dirichlet forms on its Royden boundary. Our approach is purely analytical and uses form methods.
We introduce the classes of TAP groups, in which various types of algebraic fibring are detected by the non-vanishing of twisted Alexander polynomials. We show that finitely presented LERF groups lie in the class $\mathsf{TAP}_1(R)$ for…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
In this monograph, we lay the foundations for a new theory that generalizes real algebraic geometry. Let $R|K$ be a field extension, where $R$ is a real closed field and $K$ is an ordered subfield of $R$. The main objective is to study…
For an abelian variety $A$ over a number field we study bounds depending only on the dimension of $A$ for the minimal degree $d(A)$ of a field extension over which $A$ acquires semi-stable reduction. We first compute $d(A)$ in terms of the…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
We consider the problem of partitioning the edges of a graph into as few paths as possible. This is a~subject of the classic conjecture of Gallai and a recurring topic in combinatorics. Regarding the complexity of partitioning a graph…
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…