Results 191 to 200 of about 3,028 (216)
Some of the next articles are maybe not open access.
Afrika Matematika, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiady Rakotovao Amboara +1 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiady Rakotovao Amboara +1 more
openaire +2 more sources
Efficient bijective parameterizations
ACM Transactions on Graphics, 2020We propose a novel method to efficiently compute bijective parameterizations with low distortion on disk topology meshes. Our method relies on a second-order solver. To design an efficient solver, we develop two key techniques. First, we propose a coarse shell to substantially reduce the number of collision constraints that are used to ...
Jian-Ping Su +3 more
openaire +1 more source
Geometrical Bijections in Discrete Lattices
Combinatorics, Probability and Computing, 1999We define uniformly spread sets as point sets in d-dimensional Euclidean space that are wobbling equivalent to the standard lattice ℤd. A linear image ϕ(ℤd) of ℤd is shown to be uniformly spread if and only if det(ϕ) = 1. Explicit geometrical and number-theoretical constructions are given.
Carstens, Hans-Georg +3 more
openaire +2 more sources
2013
On considere le produit infini (1 + x)(1 + x2)(1 + x3)(1 + x4) ⋯ que l’on developpe selon la methode habituelle sous la forme d’une serie \( \sum {_{n \geqslant 0} a_n x^n } \) en regroupant les termes correspondant a la meme puissance de x.
Martin Aigner, Günter M. Ziegler
openaire +1 more source
On considere le produit infini (1 + x)(1 + x2)(1 + x3)(1 + x4) ⋯ que l’on developpe selon la methode habituelle sous la forme d’une serie \( \sum {_{n \geqslant 0} a_n x^n } \) en regroupant les termes correspondant a la meme puissance de x.
Martin Aigner, Günter M. Ziegler
openaire +1 more source
The American Mathematical Monthly, 2019
When is a function from an abelian group to itself expressible as a difference of two bijections? Answering this question for finite cyclic groups solves a problem about juggling.
Daniel H. Ullman, Daniel J. Velleman
openaire +1 more source
When is a function from an abelian group to itself expressible as a difference of two bijections? Answering this question for finite cyclic groups solves a problem about juggling.
Daniel H. Ullman, Daniel J. Velleman
openaire +1 more source
Constructing sequential bijections
1997We state a simple condition on a rational subset X of a free monoid B* for the existence of a sequential function that is a one-to-one mapping of some free monoid A* onto X. As a by-product we obtain new sequential bijections of a free monoid onto another.
Christophe Prieur +2 more
openaire +1 more source
2009
Nous montrons que toute bijection de Pn(K), pour K un corps fini de caractéristique impaire, est induite par une transformation birationnelle sans point d'indétermination ...
openaire +2 more sources
Nous montrons que toute bijection de Pn(K), pour K un corps fini de caractéristique impaire, est induite par une transformation birationnelle sans point d'indétermination ...
openaire +2 more sources
2004
Consider the infinite product (1+x)(1+x 2)(1+x 3)(1+x 4) · · · and expand it in the usual way into a series \( \sum_{n \geq 0} \) a n x n by grouping together those products that yield the same power x n . By inspection we find for the first terms $$ \label{1} \prod_{k \geq 1} (1+x^{k}) = 1 + x + x^{2} + 2x^{3} + 2x^{4} + 3x^{5} + 4x^{6} + 5x^{7} +
Martin Aigner, Günter M. Ziegler
openaire +1 more source
Consider the infinite product (1+x)(1+x 2)(1+x 3)(1+x 4) · · · and expand it in the usual way into a series \( \sum_{n \geq 0} \) a n x n by grouping together those products that yield the same power x n . By inspection we find for the first terms $$ \label{1} \prod_{k \geq 1} (1+x^{k}) = 1 + x + x^{2} + 2x^{3} + 2x^{4} + 3x^{5} + 4x^{6} + 5x^{7} +
Martin Aigner, Günter M. Ziegler
openaire +1 more source
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979
In this paper we study bijective a-transducers. We derive necessary and sufficient conditions on pairs of regular sets (R,S) such that a bijective a-transducer, mapping R cnto S exists. The results obtained allow the systematic construction of an a-transducer, mapping a set R onto a set S bijectively for surprisingly "different" regular sets R and S.
H. A. Maurer, H. Nivat
openaire +1 more source
In this paper we study bijective a-transducers. We derive necessary and sufficient conditions on pairs of regular sets (R,S) such that a bijective a-transducer, mapping R cnto S exists. The results obtained allow the systematic construction of an a-transducer, mapping a set R onto a set S bijectively for surprisingly "different" regular sets R and S.
H. A. Maurer, H. Nivat
openaire +1 more source
2012
Two problems, connected with analysing empirical data are considered. First is a problem of minimizing the number of crossings in a bipartite graph. Second is a pattern matching problem for permutations. In both cases the original problem is transformed into a similar problem for an appropriate mathematical structure, which can be considered as an ...
Vohandu Leo, Peder Ahti, Tombak Mati
openaire +1 more source
Two problems, connected with analysing empirical data are considered. First is a problem of minimizing the number of crossings in a bipartite graph. Second is a pattern matching problem for permutations. In both cases the original problem is transformed into a similar problem for an appropriate mathematical structure, which can be considered as an ...
Vohandu Leo, Peder Ahti, Tombak Mati
openaire +1 more source