Related papers: A Contribution in the Rotor-router model
The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are assumed to be autonomous, anonymous and identical. They…
In the present paper, we study the geometric discrepancy with respect to families of rotated rectangles. The well-known extremal cases are the axis-parallel rectangles (logarithmic discrepancy) and rectangles rotated in all possible…
Given a genus two curve $X: y^2 = x^5 + a x^3 + b x^2 + c x + d$, we give an explicit parametrization of all other such curves $Y$ with a specified symplectic isomorphism on three-torsion of Jacobians $\mbox{Jac}(X)[3] \cong…
The properties common to the Lorenz and Chen attractors, as well as their fundamental differences, have been studied for many years in a vast number of works and remain a topic far from a rigorous and complete description. In this paper we…
The aim of this paper is to study quasitriangular structures on a class of semisimple Hopf algebras constructed through abelian extensions of $Z_2$ for an abelian group $G$. We prove that there are only two forms of them. Using such…
We investigate the construction of circulant matrices derived from primitive roots over finite fields. Our approach reduces exponential sums to Jacobi sums, thereby establishing explicit connections between character theory and matrix…
We define the analogue of linear equivalence of graph divisors for the rotor-router model, and use it to prove polynomial time computability of some problems related to rotor-routing. Using the connection between linear equivalence for…
Let Lambda be a tiled R-order. We give a description of Aut_R(Lambda) as the semidirect product of Inn(Lambda) and a certain subgroup of Aut(Q(Lambda)), where Q(Lambda) is the link graph of Lambda. Additionally, we give criteria for…
Estimates of the approximate factor model are increasingly used in empirical work. Their theoretical properties, studied some twenty years ago, also laid the ground work for analysis on large dimensional panel data models with cross-section…
This work proposes a method for effectively computing manipulation paths to rearrange similar objects in a cluttered space. The solution can be used to place similar products in a factory floor in a desirable arrangement or for retrieving a…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
The space of elliptic modular forms of fixed weight and level can be identfied with a space of intertwining operators, from a holomorphic discrete series representation of SL2(R) to a space of automorphic forms. Moreover, multiplying…
The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and combinatorics of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links…
Over the moduli space of smooth curves, the double ramification cycle can be defined by pulling back the unit section of the universal jacobian along the Abel-Jacobi map. This breaks down over the boundary since the Abel-Jacobi map fails to…
In this paper we consider the Poisson algebraic structure associated with a classical $r$-matrix, i.e. with a solution of the modified classical Yang--Baxter equation. In Section 1 we recall the concept and basic facts of the $r$-matrix…
It is shown that coassociative cones in R^7 that are r-oriented and ruled by 2-planes are equivalent to CR-holomorphic curves in the oriented Grassmanian of 2-planes in R^7. The geometry of these CR-holomorphic curves is studied and related…
We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
As a topic of mathematics, "arrangements", systems of hyperplanes, circles, and general (regular) submanifolds, attract us strongly. We present a natural elementary study of arrangements of circles. It is also a kind of new studies. Our…
While there are many examples in which robots provide social assistance, a lack of theory on how the robots should decide how to assist impedes progress in realizing these technologies. To address this deficiency, we propose a pair of…