English
Related papers

Related papers: Computing isomorphisms between lattices

200 papers

Let X be a smooth curve over a finite field of characteristic p, let E be a number field, and consider an E-compatible system of lisse sheaves on the curve X. For each place lambda of E not lying over p, the lambda-component of the system…

Number Theory · Mathematics 2007-05-23 CheeWhye Chin

We study on-line strategies for solving problems with hybrid algorithms. There is a problem Q and w basic algorithms for solving Q. For some lambda <= w, we have a computer with lambda disjoint memory areas, each of which can be used to run…

Discrete Mathematics · Computer Science 2007-05-23 Ming-Yang Kao , Yuan Ma , Michael Sipser , Yiqun Yin

A systematic algorithm for building integrating factors of the form mu(x,y') or mu(y,y') for non-linear second order ODEs is presented. When such an integrating factor exists, the algorithm determines it without solving any differential…

Computational Physics · Physics 2025-06-10 E. S. Cheb-Terrab , A. D. Roche

Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…

High Energy Physics - Theory · Physics 2026-04-30 Madhav Sinha , Thiago Silva Tavares , Hubert Saleur , Ananda Roy

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Logic in Computer Science · Computer Science 2010-10-15 Marie Ferbus-Zanda , Serge Grigorieff

An alternative proof of Lie's approach for linearization of scalar second order ODEs is derived using the relationship between $\lambda$-symmetries and first integrals. This relation further leads to a new $\lambda$-symmetry linearization…

Classical Analysis and ODEs · Mathematics 2015-04-03 Ahmad Y. Al-Dweik , M. T. Mustafa , Raed A. Mara'beh , F. M. Mahomed

We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…

Logic · Mathematics 2024-12-22 Chrysafis Hartonas

A linear isometry $R$ of $\mathbb{R}^d$ is called a similarity isometry of a lattice $\Gamma \subseteq \mathbb{R}^d$ if there exists a positive real number $\beta$ such that $\beta R\Gamma$ is a sublattice of (finite index in) $\Gamma$. The…

Metric Geometry · Mathematics 2020-11-03 Jeanine Concepcion H. Arias , Manuel Joseph C. Loquias

We study the Gaussian sequence model, i.e. $X \sim N(\mathbf{\theta}, I_\infty)$, where $\mathbf{\theta} \in \Gamma \subset \ell_2$ is assumed to be convex and compact. We show that goodness-of-fit testing sample complexity is lower bounded…

Statistics Theory · Mathematics 2025-11-03 Zeyu Jia , Yury Polyanskiy

Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…

Combinatorics · Mathematics 2023-06-05 Coen del Valle , Peter J. Dukes

In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…

Combinatorics · Mathematics 2022-10-14 R. A. Bailey , Peter J. Cameron , Michael Kinyon , Cheryl E. Praeger

The paper studies the lattice of subgroups of an isotropic reductive group G(R) over a commutative ring R, normalized by the elementary subgroup E(R). We prove the sandwich classification theorem for this lattice under the assumptions that…

Group Theory · Mathematics 2022-11-09 Anastasia Stavrova , Alexei Stepanov

We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…

Logic in Computer Science · Computer Science 2007-05-23 Michael Soltys

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Data Structures and Algorithms · Computer Science 2018-09-28 Giovanni Paolini

The paper presents the complete classification of Automorphic Lie Algebras based on $\mathfrak{sl}_n (\mathbb{C})$, where the symmetry group $G$ is finite and the orbit is any of the exceptional $G$-orbits in $\overline{\mathbb{C}}$. A key…

Mathematical Physics · Physics 2019-11-20 Vincent Knibbeler , Sara Lombardo , Jan A. Sanders

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

Dynamical Systems · Mathematics 2020-11-25 Tal Horesh , Yakov Karasik

Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…

Rings and Algebras · Mathematics 2014-07-11 Gábor Ivanyos , Ádám D. Lelkes , Lajos Rónyai

Let $K$ be a number field with ring of integers $\mathcal{O}_K$ and let $G$ be a \mbox{finite group of} odd order. Given a $G$-Galois $K$-algebra $K_h$, let $A_h$ be the square root of the inverse different of $K_h/K$, which exists by…

Number Theory · Mathematics 2017-06-22 Cindy Tsang

Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.

Rings and Algebras · Mathematics 2015-09-30 Jason Bell , James J. Zhang

A Dyson map explicitly determines the appropriate basis of electromagnetic fields which yields a unitary representation of the Maxwell equations in an inhomogeneous medium. A qubit lattice algorithm (QLA) is then developed perturbatively to…