Manuela Loi, Francesca Valenti, Giorgio Medici
et al.
CDKL5 deficiency disorder (CDD), a developmental encephalopathy caused by mutations in the cyclin-dependent kinase-like 5 (CDKL5) gene, is characterized by a complex and severe clinical picture, including early-onset epilepsy and cognitive, motor, visual, and gastrointestinal disturbances. This disease still lacks a medical treatment to mitigate, or reverse, its course and improve the patient’s quality of life. Although CDD is primarily a genetic brain disorder, some evidence indicates systemic abnormalities, such as the presence of a redox imbalance in the plasma and skin fibroblasts from CDD patients and in the cardiac myocytes of a mouse model of CDD. In order to shed light on the role of oxidative stress in the CDD pathophysiology, in this study, we aimed to investigate the therapeutic potential of Coenzyme Q10 (CoQ10), which is known to be a powerful antioxidant, using in vitro and in vivo models of CDD. We found that CoQ10 supplementation not only reduces levels of reactive oxygen species (ROS) and normalizes glutathione balance but also restores the levels of markers of DNA damage (γ-H2AX) and senescence (lamin B1), restoring cellular proliferation and improving cellular survival in a human neuronal model of CDD. Importantly, oral supplementation with CoQ10 exerts a protective role toward lipid peroxidation and DNA damage in the heart of a murine model of CDD, the Cdkl5 (+/−) female mouse. Our results highlight the therapeutic potential of the antioxidant supplement CoQ10 in counteracting the detrimental oxidative stress induced by CDKL5 deficiency.
This is a survey paper that discusses the original bounds of the seminal papers by Chernoff and Hoeffding. Moreover, it includes a variety of derivative bounds in a variety of forms. Complete proofs are provided as needed. The intent is to provide a repository of reference bounds for the interested researcher.
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for equivalence of linear codes, based on their relation to multisets of points in a projective geometry.
Michel de Lara, Jean-Philippe Chancelier, Benjamin Heymann
Pearl's d-separation is a foundational notion to study conditional independence between random variables. We define the topological conditional separation and we show that it is equivalent to the d-separation, extended beyond acyclic graphs, be they finite or infinite.
We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancellative monoids, and groups.
In this paper we present an algorithm for finding a minimum dominator coloring of orientations of paths. To date this is the first algorithm for dominator colorings of digraphs in any capacity. We prove that the algorithm always provides a minimum dominator coloring of an oriented path and show that it runs in $\mathcal{O}(n)$ time. The algorithm is available at https://github.com/cat-astrophic/MDC-orientations_of_paths/.
We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.
We prove that, in games in which all the guards move at the same turn, the eternal domination and the clique-connected cover numbers coincide for interval graphs. A linear algorithm for the eternal dominating set problem is obtained as a by-product.
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.
La transición de la guerra a la paz puede conllevar un cambio en el centro de gravedad de la violencia hacia micro-espacios deprimidos de las ciudades que constituyen lo que se puede denominar, adaptando el concepto de Guillermo O’Donnell, zonas marrones urbanas. Las situaciones de postconflicto altamente violento y las de alta violencia societal que corresponden al tipo de casos que se pueden caracterizar como casos de paz violenta, requieren un enfoque de seguridad ciudadana urbana que vaya en sintonía con el giro local que se ha dado en las aproximaciones críticas de la construcción de paz.
The irregularity of a graph $G$ is defined as the sum of weights $|d(u)-d(v)|$ of all edges $uv$ of $G$, where $d(u)$ and $d(v)$ are the degrees of the vertices $u$ and $v$ in $G$, respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively.
Exceptional sequences are certain ordered sequences of quiver representations. We use noncrossing edge-labeled trees in a disk with boundary vertices (expanding on T. Araya’s work) to classify exceptional sequences of representations of $Q$, the linearly ordered quiver with $n$ vertices. We also show how to use variations of this model to classify $c$-matrices of $Q$, to interpret exceptional sequences as linear extensions, and to give a simple bijection between exceptional sequences and certain chains in the lattice of noncrossing partitions. In the case of $c$-matrices, we also give an interpretation of $c$-matrix mutation in terms of our noncrossing trees with directed edges.
Bott-Samelson varieties factor the flag variety $G/B$ into a product of $\mathbb{C}\mathbb{P}^1$'s with a map into $G/B$. These varieties are mostly studied in the case in which the map into $G/B$ is birational; however in this paper we study fibers of this map when it is not birational. We will see that in some cases this fiber is a toric variety. In order to do so we use the moment map of a Bott-Samelson variety to translate this problem into a purely combinatorial one in terms of a subword complex. These simplicial complexes, defined by Knutson and Miller, encode a lot of information about reduced words in a Coxeter system. Pilaud and Stump realized certain subword complexes as the dual to the boundary of a polytope which generalizes the brick polytope defined by Pilaud and Santos. For a nice family of words, the brick polytope is the generalized associahedron realized by Hohlweg and Lange. These stories connect in a nice way: the moment polytope of a fiber of the Bott-Samelson map is the Brick polytope. In particular, we give a nice description of the toric variety of the associahedron.
We introduce a quasisymmetric generalization of Berele and Regev's hook Schur functions and prove that these new quasisymmetric hook Schur functions decompose the hook Schur functions in a natural way. In this paper we examine the combinatorics of the quasisymmetric hook Schur functions, providing analogues of the Robinson-Schensted-Knuth algorithm and a generalized Cauchy Identity.
We design an $O(n^3)$ algorithm to find a minimum weighted coloring of a ($P_5, \bar{P}_5$)-free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.