Related papers: A polyhedral Markov field - pushing the Arak-Surga…
We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…
We demonstrate a systematic implementation of coupling between a scalar field and the geometry of the space (curve, surface, etc.) which carries the field. This naturally gives rise to a feedback mechanism between the field and the…
We study the recent construction of maximally supersymmetric field theory Lagrangians in three spacetime dimensions that are based on algebras with a triple product. Assuming that the algebra has a positive definite metric compatible with…
Understanding the orientation of geological structures is crucial for analyzing the complexity of the Earths' subsurface. For instance, information about geological structure orientation can be incorporated into local anisotropic…
The symmetry classification method is applied to the string-like scalar fields in two-dimensional space-time. When the configurational space is three-dimensional and reducible we present the complete list of the systems admiting higher…
An algorithm for 3D terrain-following area coverage path planning is presented. Multiple adjacent paths are generated that are (i) locally apart from each other by a distance equal to the working width of a machinery, while (ii)…
Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…
A general framework for oblique projections of nonhermitian matrices onto rational Krylov subspaces is developed. To obtain this framework we revisit the classical rational Krylov subspace algorithm and prove that the projected matrix can…
A version of Markov's estimate for the derivative of a polynomial is proved with the interval [-1,1] replaced by an arbitrary continuum in the complex plane.
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…
This paper proposes a construction of $C^r$ conforming finite element spaces with arbitrary $r$ in any dimension. It is shown that if $k \ge 2^{d}r+1$ the space $\mathcal P_k$ of polynomials of degree $\le k$ can be taken as the shape…
Mathematical modelling is a cornerstone of computational biology. While mechanistic models might describe the interactions of interest of a system, they are often difficult to study. On the other hand, abstract models might capture key…
We develop a special phase field/diffusive interface method to model the nuclear architecture reorganization process. In particular, we use a Lagrange multiplier approach in the phase field model to preserve the specific physical and…
We introduce two abstract constructions for building new measurable dynamical systems from existing ones and study their ergodic properties. The first of these constructions, a "reciprocal transformation," produces a type of non-singular…
A cubic structure of polymer colloid complexes is studied. The technique of the research includes i) an analysis of well-known literature SAXS data; on this base, at some assumptions, ii) constructing a simple model to estimate geometric…
In this text, we explore the tools that Projective Differential Geometry can provide for the asymptotic analysis of classical fields on projectively compact manifolds. We emphasise on the case of order 2-compactifications and develop, in…
Understanding the nonlinear dynamics of coupled scalar fields often necessitates simulations on a 3D mesh. These simulations can be computationally expensive if a large scale separation is involved. A common solution is adaptive mesh…
This work deals with models described by three real scalar fields in one spatial dimension. We study the case where two of the three fields engender kinematical modifications, which respond as geometrical constrictions, that can be used to…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…