Adding functionalities to precomputed holograms with random mask multiplexing in holographic optical tweezers

In this study, we present a method designed to generate dynamic holograms in holographic optical tweezers. The approach combines our random mask encoding method with iterative high-efficiency algorithms. This hybrid method can be used to dynamically modify precalculated holograms, giving them new functionalities¿temporarily or permanently¿with a low computational cost. This allows the easy addition or removal of a single trap or the independent control of groups of traps for manipulating a variety of rigid structures in real time.

Petrou type-D perfect-fluid solutions in generalized Kerr-Schild form.

Generalized KerrSchild space-times for a perfect-fluid source are investigated. New Petrov type D perfect fluid solutions are obtained starting from conformally flat perfect-fluid metrics.

An index for quantifying flocking behavior

One of the classic research topics in adaptive behavior is the collective displacement of groups of organisms such as flocks of birds, schools of fish, herds of mammals and crowds of people. However, most agent-based simulations of group behavior do not provide a quantitative index for determining the point at which the flock emerges. We have developed an index of the aggregation of moving individuals in a flock and have provided an example of how it can be used to quantify the degree to which a group of moving individuals actually forms a flock.

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.

Distortion of surface groups in Cat (0) free-by-cyclic groups

Given a non-positively curved 2-complex with a circle-valued Morse function satisfying some extra combinatorial conditions, we describe how to locally isometrically embed this in a larger non- positively curved 2-complex with free-by-cyclic fundamental group. This embedding procedure is used to produce examples of CAT(0) free-by-cyclic groups that contain closed hyperbolic surface subgroups with polynomial distortion of arbitrary degree. We also produce examples of CAT(0) hyperbolic free-by-cyclic groups that contain closed hyperbolic surface subgroups that are exponentially distorted.

The Zariski-Lefschetz principle for higher homotopy groups of nongeneric pencils

We prove a general Zariski-van Kampen-Lefschetz type theorem for higher homotopy groups of generic and nongeneric pencils on singular open complex spaces.

Pure braid subgroups of braided Thompson's groups

"Vegeu el resum a l'inici del document del fitxer adjunt."

Distortion of wreath products in some finitely presented groups

"Vegeu el resum a l'inici del document del fitxer adjunt."

Infinite index subgroups and finiteness properties of intersections of geometrically finite groups

We explore which types of finiteness properties are possible for intersections of geometrically finite groups of isometries in negatively curved symmetric rank one spaces. Our main tool is a twist construction which takes as input a geometrically finite group containing a normal subgroup of infinite index with given finiteness properties and infinite Abelian quotient, and produces a pair of geometrically finite groups whose intersection is isomorphic to the normal subgroup.

Minimal truncations of supersingular p-divisible groups

"Vegeu el resum a l'inici del document del fitxer adjunt."

The mean dehn functions of Abelian groups

"Vegeu el resum a l'inici del document del fitxer adjunt."

Minimal lenght elements of Thompson's groups F(p)

We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.

Parabolic and quasiparabolic subgroups of free partially commutative groups

Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.

Elements of algebraic geometry and the positive theory of partially commutative groups

The first main result of the paper is a criterion for a partially commutative group G to be a domain. It allows us to reduce the study of algebraic sets over G to the study of irreducible algebraic sets, and reduce the elementary theory of G (of a coordinate group over G) to the elementary theories of the direct factors of G (to the elementary theory of coordinate groups of irreducible algebraic sets). Then we establish normal forms for quantifier-free formulas over a non-abelian directly indecomposable partially commutative group H. Analogously to the case of free groups, we introduce the notion of a generalised equation and prove that the positive theory of H has quantifier elimination and that arbitrary first-order formulas lift from H to H * F, where F is a free group of finite rank. As a consequence, the positive theory of an arbitrary partially commutative group is decidable.