Related papers: Computing with jets
Nowadays, there are several complex systems in different sectors such as aviation, air traffic control ...etc. These systems do not have a precise perimeter, they are open and made of various specific components built with different…
We study jet schemes of Newton non-degenerate plane curve singularities. We identify a subgraph of the graph of jet components and show that it can be constructed from walks on the lattice points in the first quadrant of the Cartesian…
In this paper we give a complete description of the irreducible components of the jet schemes (with origin in the singular locus) of a two-dimensional quasi-ordinary hypersurface singularity. We associate with these components and with…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
TopologicalNumbers.jl is an open-source Julia package designed to calculate topological invariants, mathematical quantities that characterize the properties of materials in condensed matter physics. These invariants, such as the Chern…
Generic linkage is used to compute a prime ideal such that the radical of the initial ideal of the prime ideal is equal to the radical of a given codimension two monomial ideal that has a Cohen-Macaulay quotient ring.
All subalgebras, idempotents, left(right) ideals and left quasi-units of two-dimensional algebras are described. Classification of algebras with given number of subalgebras, left(right) ideals are provided. In particular, a list of…
I describe a class of iterative jet algorithms that are based on maximizing a fixed function of the total 4-momentum rather than clustering of pairs of jets. I describe some of the properties of the simplest examples of this class,…
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
This paper provides an overview of selected results and open problems in the theory of hyperplane arrangements, with an emphasis on computations and examples. We give an introduction to many of the essential tools used in the area, such as…
We present an explicit formula for computing toric residues as a quotient of two determinants, a la Macaulay, where the numerator is a minor of the denominator. We also give an irreducible representation of toric residues by extending the…
We study the Macaulay coefficients induced by the ideal and quotient segments of a degree-$\delta$ monomial in $n$ variables. We give explicit formulas for these coefficients and establish a duality between the two theories. Our main result…
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
In this paper we systematically consider various ways of generating integrable and separable Hamiltonian systems in canonical and in non-canonical representations from algebraic curves on the plane. In particular, we consider St\"ackel…
We present analytic evaluations of some integrals needed to give explicitly the integrated real-virtual integrated counterterms, based on a recently proposed subtraction scheme for next-to-next-to-leading order (NNLO) jet cross sections.…
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…
In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We also include a computational comparison of several existing…
Butterflies are the smallest non-trivial subgraph in bipartite graphs, and therefore having efficient computations for analyzing them is crucial to improving the quality of certain applications on bipartite graphs. In this paper, we design…
For $m\in \mathbb{N}, m\geq 1,$ we determine the irreducible components of the $m-th$ jet scheme of a normal toric surface $S.$ We give formulas for the number of these components and their dimensions. When $m$ varies, these components give…