Related papers: Complexity bounds on supermesh construction for qu…
Parametrized motion planning algorithms have high degree of flexibility and universality, they can work under a variety of external conditions, which are viewed as parameters and form part of the input of the algorithm. In this paper we…
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations. Theoretical computer science suggests that these restrictions are not mere…
The isometric embedding of surfaces in three-dimensional space is fundamental to various physical systems, from elastic sheets to programmable materials. While continuous surfaces typically admit unique solutions under suitable boundary…
The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…
We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same…
In the past decade frame fields have emerged as a promising approach for generating hexahedral meshes for CFD and CAE applications. One important problem asks for construction of a boundary-aligned frame field with prescribed singularity…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
We give a lower bound on the Ulrich complexity of hypersurfaces of dimension $n \ge 6$. The bound improves the result in [BES] for $n \le 78$.
New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.
A new global approach in the study of duality transformations is introduced. The geometrical structure of complex line bundles is generalized to higher order U(1) bundles which are classified by quantized charges and duality maps are…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
Complex nanophotonic structures hold the potential to deliver exquisitely tailored optical responses for a range of applications. Metal-insulator-metal (MIM) metasurfaces arranged in supercells, for instance, can be tailored by geometry and…
We present a simple mathematical framework and API for parallel mesh and data distribution, load balancing, and overlap generation. It relies on viewing the mesh as a Hasse diagram, abstracting away information such as cell shape,…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
A deformed $q$-calculus is developed on the basis of an algebraic structure involving graded brackets. A number operator and left and right shift operators are constructed for this algebra, and the whole structure is related to the algebra…
Chiral superfields have been used, and extensively, almost ever since supersymmetry has been discovered. Complex linear superfields afford an alternate representation of matter, but are widely misbelieved to be 'physically equivalent' to…
We consider some simple examples of supersymmetric quantum mechanical systems and explore their possible geometric interpretation with the help of geometric aspects of real Clifford algebras. This leads to natural extensions of the…
Experimental limits on supersymmetry and similar theories are difficult to set because of the enormous available parameter space and difficult to generalize because of the complexity of single points. Therefore, more phenomenological,…
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion…