On a conjecture by Pierre Cartier about a group of associators

In \cite{cartier2}, Pierre Cartier conjectured that for any non commutative formal power series $\Phi$ on $X=\{x_0,x_1\}$ with coefficients in a \Q-extension, $A$, subjected to some suitable conditions, there exists an unique algebra homomorphism $\varphi$ from the \Q-algebra generated by the convergent polyz\^etas to $A$ such that $\Phi$ is computed from $\Phi_{KZ}$ Drinfel'd associator by applying $\varphi$ to each coefficient. We prove $\varphi$ exists and it is a free Lie exponential over $X$. Moreover, we give a complete description of the kernel of polyz\^eta and draw some consequences about a structure of the algebra of convergent polyz\^etas and about the arithmetical nature of the Euler constant

Electroweak phase transition in the economical 3-3-1 model

We consider the EWPT in the economical 3-3-1 (E331) model. Our analysis shows that the EWPT in the model is a sequence of two first-order phase transitions, $SU(3) \rightarrow SU(2)$ at the TeV scale and $SU(2) \rightarrow U(1)$ at the $100$ GeV scale. The EWPT $SU(3) \rightarrow SU(2)$ is triggered by the new bosons and the exotic quarks; its strength is about $1 - 13$ if the mass ranges of these new particles are $10^2 \,\mathrm{GeV} - 10^3 \,\mathrm{GeV}$. The EWPT $SU(2) \rightarrow U(1)$ is strengthened by only the new bosons; its strength is about $1 - 1.15$ if the mass parts of $H^0_1$, $H^\pm_2$ and $Y^\pm$ are in the ranges $10 \,\mathrm{GeV} - 10^2 \,\mathrm{GeV}$. The contributions of $H^0_1$ and $H^{\pm}_2$ to the strengths of both EWPTs may make them sufficiently strong to provide large deviations from thermal equilibrium and B violation necessary for baryogenesis.Comment: 17 pages, 9 figure

Combinatorics of ϕ\phi-deformed stuffle Hopf algebras

In order to extend the Sch\"utzenberger's factorization to general perturbations, the combinatorial aspects of the Hopf algebra of the $\phi$-deformed stuffle product is developed systematically in a parallel way with those of the shuffle product

Efficacy of Neural Prediction-Based NAS for Zero-Shot NAS Paradigm

In prediction-based Neural Architecture Search (NAS), performance indicators derived from graph convolutional networks have shown significant success. These indicators, achieved by representing feed-forward structures as component graphs through one-hot encoding, face a limitation: their inability to evaluate architecture performance across varying search spaces. In contrast, handcrafted performance indicators (zero-shot NAS), which use the same architecture with random initialization, can generalize across multiple search spaces. Addressing this limitation, we propose a novel approach for zero-shot NAS using deep learning. Our method employs Fourier sum of sines encoding for convolutional kernels, enabling the construction of a computational feed-forward graph with a structure similar to the architecture under evaluation. These encodings are learnable and offer a comprehensive view of the architecture's topological information. An accompanying multi-layer perceptron (MLP) then ranks these architectures based on their encodings. Experimental results show that our approach surpasses previous methods using graph convolutional networks in terms of correlation on the NAS-Bench-201 dataset and exhibits a higher convergence rate. Moreover, our extracted feature representation trained on each NAS-Benchmark is transferable to other NAS-Benchmarks, showing promising generalizability across multiple search spaces. The code is available at: https://github.com/minh1409/DFT-NPZS-NASComment: 12 pages, 6 figure

Dual bases for non commutative symmetric and quasi-symmetric functions via monoidal factorization

In this work, an effective construction, via Sch\"utzenberger's monoidal factorization, of dual bases for the non commutative symmetric and quasi-symmetric functions is proposed

Independence of hyperlogarithms over function fields via algebraic combinatorics

We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only singularities of first order (Fuchsian-type equations) and this implies that they freely span a space which contains no primitive. We give direct applications where we extend the property of linear independence to the largest known ring of coefficients