中文
相关论文

相关论文: Branching problems of unitary representations

200 篇论文

In this paper we the formulation of inverse problems as constrained minimization problems and their iterative solution by gradient or Newton type. We carry out a convergence analysis in the sense of regularization methods and discuss…

数值分析 · 数学 2021-01-15 Barbara Kaltenbacher , Kha Van Huynh

We study inverse boundary problems for the advection diffusion equation on an admissible manifold, i.e. a compact Riemannian manifold with boundary of dimension $\ge 3$, which is conformally embedded in a product of the Euclidean real line…

偏微分方程分析 · 数学 2017-04-20 Katya Krupchyk , Gunther Uhlmann

We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.

表示论 · 数学 2012-03-01 A. N. Panov

In this paper, we discuss a class of spectral partition problems with a measure constraint, for partitions of a given bounded connected open set. We establish the existence of an optimal open partition, showing that the corresponding…

偏微分方程分析 · 数学 2023-06-22 Pêdra D. S. Andrade , Ederson Moreira dos Santos , Makson S. Santos , Hugo Tavares

We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders propagation, we identify one decomposition that maintains a…

人工智能 · 计算机科学 2009-09-18 Christian Bessiere , George Katsirelos , Nina Narodytska , Claude-Guy Quimper , Toby Walsh

In this paper, we consider a fully nonlinear problem on manifolds with boundaries of negative admissible curvatures. As a consequence, we conclude the existence of certain types of metrics on the general differential manifolds with…

偏微分方程分析 · 数学 2011-02-22 Aobing Li , Huan Zhu

The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A binary CSP instance can be presented as a labelled…

计算复杂性 · 计算机科学 2019-06-28 David A. Cohen , Martin C. Cooper , Peter G. Jeavons , Stanislav Zivny

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints,…

最优化与控制 · 数学 2018-10-10 Amitabh Basu , Christopher Thomas Ryan , Sriram Sankaranarayanan

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

组合数学 · 数学 2014-07-18 Thomas Michael Keller

We obtain a complete classification of the continuous unitary representations of oligomorphic permutation groups (those include the infinite permutation group $S_\infty$, the automorphism group of the countable dense linear order, the…

群论 · 数学 2012-05-21 Todor Tsankov

New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.

表示论 · 数学 2015-06-26 Vladimir Shchigolev

We study the unitary boundary representation of a strongly transitive group acting on a right-angled hyperbolic building. We show its irreducibility. We do so by associating to such a representation a representation of a certain Hecke…

动力系统 · 数学 2015-06-23 Uri Bader , Jan Dymara

We identify and study a simple combinatorial problem that is derived from submodularity issues encountered in the theory of tangles of graphs and abstract separation systems.

组合数学 · 数学 2025-05-16 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

In this expository paper, we first review the classification of the restricted simple Lie algebras in characteristic different from 2 and 3 and then we describe their infinitesimal deformations. We conclude by indicating some possible…

环与代数 · 数学 2014-01-06 Filippo Viviani

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

环与代数 · 数学 2007-05-23 Edward S. Letzter

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

符号计算 · 计算机科学 2026-01-14 Louis Gaillard

Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into…

人工智能 · 计算机科学 2015-05-19 Toby Walsh

The goal of harmonic analysis on a (noncommutative) group is to decompose the most `natural' unitary representations of this group (like the regular representation) on irreducible ones. The infinite-dimensional unitary group U(infinity) is…

表示论 · 数学 2007-05-23 Grigori Olshanski

The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…

经典分析与常微分方程 · 数学 2010-03-23 Gerd Mockenhaupt , Terence Tao

In this paper, the spectrum and the decomposability of a multivariate rational function are studied by means of the effective Noether's irreducibility theorem given by Ruppert. With this approach, some new effective results are obtained. In…

数论 · 数学 2009-06-17 Laurent Busé , Guillaume Chèze , Salah Najib