Related papers: Building Bricks with Bricks, with Mathematica

In this article we study the number of different cuboids $\mathcal{O}(N)$ that can be built with an arbitrary number $N$ of equal cubes. This problem is equivalent to find the number of different cuboids of volume $N$ with integer length…

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

We construct quadratic finite-dimensional Poisson algebras and their quantum versions related to rank N and degree one vector bundles over elliptic curves with n marked points. The algebras are parameterized by the moduli of curves. For N=2…

The construction of Mapper has emerged in the last decade as a powerful and effective topological data analysis tool that approximates and generalizes other topological summaries, such as the Reeb graph, the contour tree, split, and joint…

In this paper we develop a concrete way to construct bodies of constant width in dimension three. They are constructed from special embeddings of self-dual graphs.

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…

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…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

Polymetric walls are walls built from bricks in more than one size. Architects and builders want to built polymetric walls that satisfy certain structural and aesthetical constraints. In a recent paper by de Jong, Vinduska, Hans and Post…

The "Perpendicular Bisectors Construction" is a natural way to seek a replacement for the circumcenter of a noncyclic quadrilateral in the plane. In this paper, we generalize this iterative construction to a construction on polytopes with…

We show how to construct linearizations of matrix polynomials $z\mathbf{a}(z)\mathbf{d}_0 + \mathbf{c}_0$, $\mathbf{a}(z)\mathbf{b}(z)$, $\mathbf{a}(z) + \mathbf{b}(z)$ (when $\mathrm{deg}\left(\mathbf{b}(z)\right) <…

We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n…

Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…

Let $(B(t))_{t\in [0,1]}$ be the linear Brownian motion and $(X_n(t))_{t\in [0,1]}$ be the $(n-1)$-fold integral of Brownian motion, $n$ being a positive integer: $$ X_n(t)=\int_0^t \frac{(t-s)^{n-1}}{(n-1)!} \,\dd B(s) for any $t\in[0,1]$.…

The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem with wavelet trees is their…

Quadratic Poisson brackets on a vector space equipped with a bilinear multiplication are studied. A notion of a bracket compatible with the multiplication is introduced and an effective criterion of such compatibility is given. Among…