Related papers: A Well-Defined Jellyfish Algorithm for the Affine …
Fixed an algebraic scheme $Y$. We suggest a definition for the conjugate of an algebraic scheme $X$ over $Y$ in an evident manner; then $X$ is said to be Galois closed over $Y$ if $X$ has a unique conjugate over $Y$. Now let $X$ and $Y$…
Given an algorithm of resolution of singularities satisfying certain conditions (``good algorithms''), natural notions of simultaneous algorithmic resolution, or equiresolution, for families of embedded schemes (parametrized by a reduced…
We analyse three time integration schemes for unfitted methods in fluid structure interaction. In Alghorithm 1 we propose a fully discrete monolithic algorithm with P1 P1 stabilized finite elements for the fluid problem; for this alghorithm…
Jones and Penneys showed that a finite depth subfactor planar algebra embeds in the bipartite graph planar algebra of its principal graph, via a Markov towers of algebras approach. We relate several equivalent perspectives on the notion of…
We introduce new objects, called $(G,c)$-bands, associated with a simple simply-connected algebraic group $G$, and a Coxeter element $c$ in its Weyl group. We show that bands of a given type are the $K$-points of an infinite dimensional…
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…
An algorithm for constructing primitive adjoint-invariant functions on a complex simple Lie algebra is presented. The construction is intrinsic in the sense that it does not resort to any representation. A primitive invariant function on…
A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…
In this paper, we present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding a graph metric into a tree metric (thus improving and simplifying the factor 100 and 27 algorithms of B\v{a}doiu,…
In 1992 Wirthm\"{u}ller showed that for any irreducible root system not of type $E_8$ the ring of weak Jacobi forms invariant under Weyl group is a polynomial algebra. However, it has recently been proved that for $E_8$ the ring is not a…
Mining subgraphs with interesting structural properties from networks (or graphs) is a computationally challenging task. In this paper, we propose two algorithms for enumerating all connected induced subgraphs of a given cardinality from…
In this paper, we use partial differential equations to find the decomposition of the polynomial algebra over the basic irreducible module of $E_7$ into a sum of irreducible submodules. Moreover, we obtain a combinatorial identity, saying…
We introduce tools from numerical analysis and high dimensional probability for precision control and complexity analysis of subdivision-based algorithms in computational geometry. We combine these tools with the continuous amortization…
We propose a new method to design adaptation algorithms that guarantee a certain prescribed level of performance and are applicable to systems with nonconvex parameterization. The main idea behind the method is, given the desired…
The direct sum of irreducible level one integrable representations of affine Kac-Moody Lie algebra of (affine) type $ADE$ carries a structure of $P/Q$-graded vertex operator algebra. There exists a filtration on this direct sum studied by…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
In this paper we prove a general result saying that under certain hypothesis an embedding of an affine vertex algebra into an affine $W$--algebra is conformal if and only if their central charges coincide. This result extends our previous…
One of the most celebrated applications of Gauss' $_2F_1$ hypergeometric functions is in connection with the rapid convergence of sequences and special values that arise in the theory of arithmetic and geometric means. This theory was the…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…
We present a new algorithm for constructing a Chevalley basis for any Chevalley Lie algebra over a finite field. This is a necessary component for some constructive recognition algorithms of exceptional quasisimple groups of Lie type. When…