Results 191 to 200 of about 8,688 (230)
Continuous invariant-based asymmetries of periodic crystals quantify deviations from higher symmetry. [PDF]
IUCrJMajumder S +6 more
europepmc +1 more source
A Bijection for Euler’s Partition Theorem in the Spirit of Bressoud [PDF]
Ramanujan Journal, 2020 For each positive integer n, we construct a bijection between the odd partitions of n and the distinct partitions of n. Our bijection extends a bijection of Bressoud between the odd-and-distinct partitions of n and the splitting partitions of n.
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
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 +2 more sources
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.
Hermann A. Maurer, Maurice 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.
Hermann A. Maurer, Maurice Nivat
openaire +1 more source
Bijective projection in a shell
ACM Transactions on Graphics, 2020We introduce an algorithm to convert a self-intersection free, orientable, and manifold triangle mesh T into a generalized prismatic shell equipped with a bijective projection operator to map T to a class of discrete surfaces contained within the shell whose normals ...
Zhongshi Jiang +3 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 +2 more sources
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 ...
Leo Vohandu, Ahti Peder, Mati Tombak
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 ...
Leo Vohandu, Ahti Peder, Mati Tombak
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 0002 +2 more
openaire +2 more sources
A Bijective Proof of a Theorem of Knuth
Combinatorics, Probability and Computing, 2010The line graph G of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix Tree Theorem to prove a formula for the number of spanning trees of G, and he asked for a bijective proof [6]. In this paper, we give a bijective proof of Knuth's formula. As a result of this proof, we find
Hoda Bidkhori, Shaunak Kishore
openaire +2 more sources