Search results for "combinatoric"
showing 10 items of 1776 documents
DNA combinatorial messages and Epigenomics: The case of chromatin organization and nucleosome occupancy in eukaryotic genomes
2019
Abstract Epigenomics is the study of modifications on the genetic material of a cell that do not depend on changes in the DNA sequence, since those latter involve specific proteins around which DNA wraps. The end result is that Epigenomic changes have a fundamental role in the proper working of each cell in Eukaryotic organisms. A particularly important part of Epigenomics concentrates on the study of chromatin, that is, a fiber composed of a DNA-protein complex and very characterizing of Eukaryotes. Understanding how chromatin is assembled and how it changes is fundamental for Biology. In more than thirty years of research in this area, Mathematics and Theoretical Computer Science have gai…
Reverse-safe data structures for text indexing
2021
We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed). A data structure D is called z-reverse-safe when there exist at least z datasets with the same set of answers as the ones stored by D. The main challenge is to ensure that D stores as many answers to useful queries as possible, is constructed efficiently, and has size close to the size of the original dataset it encodes. Given a text of length n and an integer z, we propose an algorithm which constructs a z-reverse-safe data structure that has size O(n) and answers pattern matching queries of length at most d optim…
Packing colorings of subcubic outerplanar graphs
2018
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…
Magic informationally complete POVMs with permutations
2017
Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation [M. Planat and Rukhsan-Ul-Haq, Preprint 1701.06443]. We show in this paper that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs. Such IC-POVMs, investigated in dimensions $2$ to $12$, exhibit simple finite geometries in their projector products and, for dimensions $4$ and $8$ and $9$, relate to two-qubit, three-qubit and two-qutrit contextuality.
Exploring Relationships Between Anthropometry, Body Composition, Maturation, and Selection for Competition: A Study in Youth Soccer Players
2021
PurposeThe purpose of this study was to analyze variations of selection for competition between late and early mature players and test the relationships between anthropometry, body composition, maturation, and selection for competition.MethodsSeventy-nine youth soccer players from under-11 to under-14 participated in this study, over 6 months. Body composition and maturity offset were estimated based on anthropometric data collected. Participants were also monitored for their number of matches as starters and time of play accrued in minutes.ResultsMinutes played had large correlation coefficients with maturity offset (r = 0.58), and leg length and sitting height interaction (r = 0.56). Mult…
Moduli spaces of rank two aCM bundles on the Segre product of three projective lines
2016
Let P^n be the projective space of dimension n on an algebraically closed field of characteristic 0 and F be the image of the Segre embedding of P^1xP^1xP^1 inside P^7. In the present paper we deal with the moduli spaces of locally free sheaves E on F of rank 2 with h^i(F,E(t))=0 for i=1,2 and each integer t.
Lie Algebras Generated by Extremal Elements
1999
We study Lie algebras generated by extremal elements (i.e., elements spanning inner ideals of L) over a field of characteristic distinct from 2. We prove that any Lie algebra generated by a finite number of extremal elements is finite dimensional. The minimal number of extremal generators for the Lie algebras of type An, Bn (n>2), Cn (n>1), Dn (n>3), En (n=6,7,8), F4 and G2 are shown to be n+1, n+1, 2n, n, 5, 5, and 4 in the respective cases. These results are related to group theoretic ones for the corresponding Chevalley groups.
Computing the Original eBWT Faster, Simpler, and with Less Memory
2021
Mantaci et al. [TCS 2007] defined the \(\mathrm {eBWT}\) to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. However, since this introduction, it has been used more generally to describe any \(\mathrm {BWT}\) of a collection of strings, and the fundamental property of the original definition (i.e., the independence from the input order) is frequently disregarded. In this paper, we propose a simple linear-time algorithm for the construction of the original \(\mathrm {eBWT}\), which does not require the preprocessing of Bannai et al. [CPM 2021]. As a byproduct, we obtain the first linear-time algorithm for computing the \(\mathrm {BWT}\) of a single string that uses …
The average element order and the number of conjugacy classes of finite groups
2021
Abstract Let o ( G ) be the average order of the elements of G, where G is a finite group. We show that there is no polynomial lower bound for o ( G ) in terms of o ( N ) , where N ⊴ G , even when G is a prime-power order group and N is abelian. This gives a negative answer to a question of A. Jaikin-Zapirain.
The proof of Birman’s conjecture on singular braid monoids
2003
Let B_n be the Artin braid group on n strings with standard generators sigma_1, ..., sigma_{n-1}, and let SB_n be the singular braid monoid with generators sigma_1^{+-1}, ..., sigma_{n-1}^{+-1}, tau_1, ..., tau_{n-1}. The desingularization map is the multiplicative homomorphism eta: SB_n --> Z[B_n] defined by eta(sigma_i^{+-1}) =_i^{+-1} and eta(tau_i) = sigma_i - sigma_i^{-1}, for 1 <= i <= n-1. The purpose of the present paper is to prove Birman's conjecture, namely, that the desingularization map eta is injective.