中文
相关论文

相关论文: A universal theory of switching for combinatorial …

200 篇论文

Kendall transformation is a conversion of an ordered feature into a vector of pairwise order relations between individual values. This way, it preserves ranking of observations and represents it in a categorical form. Such transformation…

机器学习 · 计算机科学 2023-08-15 Miron Bartosz Kursa

A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed…

组合数学 · 数学 2022-06-28 Bo-Jun Yuan , Shaowei Sun , Dijian Wang

We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…

泛函分析 · 数学 2022-04-26 Mateo Tomašević

Spectral hypergraph theory studies the structural properties of a hypergraph that can be inferred from the eigenvalues and the eigenvectors of either matrices or tensors associated with it. In this paper we study the spectral…

组合数学 · 数学 2026-04-08 Aida Abiad , Joshua Cooper , Utku Okur

The generic transition in the boson Hubbard model, occurring at an incommensurate chemical potential, is studied in the link-current representation using the recently developed directed geometrical worm algorithm. We find clear evidence for…

强关联电子 · 物理学 2009-11-10 Fabien Alet , Erik S. Sorensen

The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…

组合数学 · 数学 2020-12-23 Leonardo N. Coregliano , Alexander A. Razborov

The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Damiano Mazza

This article represents a major step in the unification of the theory of algebraic, topological and singular transition matrices by introducing a definition which is a generalization that encompasses all of the previous three. When this…

动力系统 · 数学 2013-11-15 Robert Franzosa , Ketty A. de Rezende , Ewerton R. Vieira

We introduce the notion of combinatorial gauge symmetry -- a local transformation that includes single spin rotations plus permutations of spins (or swaps of their quantum states) -- that preserve the commutation and anti-commutation…

强关联电子 · 物理学 2020-08-11 Claudio Chamon , Dmitry Green , Zhi-Cheng Yang

Hadamard's global inverse theorem provides conditions for a function to be globally invertible on Rn. In this note we show that the conditions are robust enough for the conclusion to hold even if we relax the conditions by removing the…

泛函分析 · 数学 2015-10-16 Michael Ruzhansky , Mitsuru Sugimoto

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

离散数学 · 计算机科学 2018-06-19 Oliver Knill

We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and the method works in principle on any…

谱理论 · 数学 2020-04-16 Christian Sadel

The universal invariant with respect to a given ribbon Hopf algebra is a tangle invariant that dominates all the Reshetikhin-Turaev invariants built from the representation theory of the algebra. We construct a canonical strict monoidal…

几何拓扑 · 数学 2025-06-24 Jorge Becerra

Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that…

组合数学 · 数学 2023-06-30 Matteo Cati , Dmitrii V. Pasechnik

A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…

组合数学 · 数学 2021-11-08 Duncan Adamson , Argyrios Deligkas , Vladimir V. Gusev , Igor Potapov

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

dg-ga · 数学 2009-09-25 E. Getzler , M. M. Kapranov

The Hadamard quasigroup product has recently been introduced as a natural generalization of the classical Hadamard product of matrices. It is defined as the superposition operator of three binary operations, one of them being a quasigroup…

组合数学 · 数学 2024-10-31 Raúl M. Falcón , L. Mella , P. Vojtěchovský

Recent studies of the topological properties of a general class of lattice Dirac operators are reported. This is based on a specific algebraic realization of the Ginsparg-Wilson relation in the form…

高能物理 - 格点 · 物理学 2016-09-01 Kazuo Fujikawa

We establish a fixed point theorem for mappings of square matrices of all sizes which respect the matrix sizes and direct sums of matrices. The conclusions are stronger if such a mapping also respects matrix similarities, i.e., is a…

泛函分析 · 数学 2012-10-22 Gulnara Abduvalieva , Dmitry S. Kaliuzhnyi-Verbovetskyi

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

数据结构与算法 · 计算机科学 2007-05-23 Sandor P. Fekete , Joerg Schepers