1,351 results for matrix · 0.104s

Sponsored Partners
arxiv.org/abs/1705.08288v1

The Effects of Majorana Phases in Estimating the Masses of Neutrinos

Majorana CP violating phases coming from heavy right-handed Majorana mass matrices ($M_{RR}$) are considered to estimate the masses of neutrinos.The effects of phases on quasi-degenerate neutrinos mass matrix obeying $μ$-$τ$ symmetry predicts the r...

github.com/abusufyanvu/6S191_MIT_DeepLearning

abusufyanvu/6S191_MIT_DeepLearning

MIT Introduction to Deep Learning (6.S191) Instructors: Alexander Amini and Ava Soleimany Course Information Summary Prerequisites Schedule Lectures Labs, Final Projects, Grading, and Prizes Software labs Gather.Town lab + Office Hour sessions Final project Paper Review Project P…

arxiv.org/abs/2504.05264v1

Existence and characterizations of hyper-dual group inverse

Motivated by the recent work of Xiao and Zhong [AIMS Math. 9 (2024), 35125--35150: MR4840882], we propose a generalized inverse for a hyper-dual matrix called hyper-dual group generalized inverse (HDGGI). Under certain necessary and sufficient condit...

arxiv.org/abs/2102.10657v2

A construction of swap or switch polynomials

We discuss several constructions of swap polynomials, that is 2--tensor valued matrix polynomials which are multiples of the swap or switch operator....

arxiv.org/abs/1312.1769v2

HOMFLY polynomial from a generalized Yang-Yang function

Starting from the free field realization of Kac-Moody Lie algebra, we define a generalized Yang-Yang function. Then for the Lie algebra of type $A_{n}$, we derive braiding and fusion matrix by braiding the thimble from the generalized Yang-Yang funct...

arxiv.org/abs/1609.00515v1

Enumerating independent vertex sets in grid graphs

A set of vertices in a graph is called independent if no two vertices of the set are connected by an edge. In this paper we use the state matrix recursion algorithm, developed by Oh, to enumerate independent vertex sets in a grid graph and even furth...

arxiv.org/abs/2310.09523v1

Toughness and spectral radius in graphs

The Brouwer's toughness conjecture states that every $d$-regular connected graph always has $t(G)>\frac{d}λ-1$ where $λ$ is the second largest absolute eigenvalue of the adjacency matrix. In 1988, Enomoto introduced a variation of toughness $τ(G)$...

arxiv.org/abs/0807.3142v3

Investigation of quantum roulette

In this paper, by using permutation matrices as a representation of symmetric group $S_N$ and Fourier matrix, we investigate quantum roulette with an arbitrary $N$-state. This strategy, which we introduce, is general method that allows us to solve...

arxiv.org/abs/2311.02101v1

Solving MaxSAT with Matrix Multiplication

We propose an incomplete algorithm for Maximum Satisfiability (MaxSAT) specifically designed to run on neural network accelerators such as GPUs and TPUs. Given a MaxSAT problem instance in conjunctive normal form, our procedure constructs a Restricte...

arxiv.org/abs/0807.3081v1

A New Car-Following Model Inspired by Galton Board

Different from previous models based on scatter theory and random matrix theory, a new interpretation of the observed log-normal type time-headway distribution of vehicles is presented in this paper. Inspired by the well known Galton Board, this mo...

arxiv.org/abs/1601.04101v1

NLO efforts in Herwig++

With the advent and recent extension of the BLHA standard to interface Monte Carlo event generators and one-loop matrix element providers, the Herwig++ event generator has expanded its range of applicability to a multitude of underlying hard processe...

arxiv.org/abs/1111.0119v1

Trouble shooting for covariance fitting in highly correlated data

We report a possible solution to the trouble that the covariance fitting fails when the data is highly correlated and the covariance matrix has small eigenvalues. As an example, we choose the data analysis of highly correlated $B_K$ data on the basis...