English
Related papers

Related papers: Almost solutions of equations in permutations

200 papers

For a permutation f of an n-dimensional vector space V over a finite field of order q we let k-affinity(f) denote the number of k-flats X of V such that f(X) is also a k-flat. By k-spectrum(n,q) we mean the set of integers k-affinity(f)…

Combinatorics · Mathematics 2007-05-23 W. Edwin Clark , Xiang-dong Hou , Alec Mihailovs

We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic…

Multiagent Systems · Computer Science 2013-01-29 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

The method of the fundamental solutions (MFS) is used to construct an approximate solution for a partial differential equation in a bounded domain. It is demonstrated by combining the fundamental solutions shifted to the points outside the…

Numerical Analysis · Mathematics 2020-09-30 Shin-Ichiro Ei , Hiroyuki Ochiai , Yoshitaro Tanaka

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

Mathematical Software · Computer Science 2007-05-23 Nicolas Brisebarre , Jean-Michel Muller

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

Combinatorics · Mathematics 2016-10-10 Gábor Hegedüs

Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…

Quantum Physics · Physics 2016-10-25 Sevag Gharibian , Julia Kempe

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Nik Ruskuc , Vince Vatter

We show that a proportionality between the entanglement Hamiltonian and the Hamiltonian of a subsystem exists near the limit of maximal entanglement under certain conditions. Away from that limit, solvable models show that the coupling…

Statistical Mechanics · Physics 2015-05-28 Ingo Peschel , Ming-Chiang Chung

We construct a previously unknown $E_2$-quasi-exactly solvable non-Hermitian model whose eigenfunctions involve weakly orthogonal polynomials obeying three-term recurrence relations that factorize beyond the quantization level. The model…

Quantum Physics · Physics 2015-05-18 Andreas Fring

An extension of Riewe's fractional Hamiltonian formulation is presented for fractional constrained systems. The conditions of consistency of the set of constraints with equations of motion are investigated. Three examples of fractional…

Mathematical Physics · Physics 2009-11-11 S. Muslih , D. Baleanu

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Logic · Mathematics 2016-09-13 André Nies , Andrea Sorbi

Fix integers a_1,...,a_d satisfying a_1 + ... + a_d = 0. Suppose that f : Z_N -> [0,1], where N is prime. We show that if f is ``smooth enough'' then we can bound from below the sum of f(x_1)...f(x_d) over all solutions (x_1,...,x_d) in Z_N…

Number Theory · Mathematics 2007-08-29 Ernie Croot

Let $\mathcal{S}_n$ denote the set of permutations of $\{1,2,\dots,n\}$. The function $f(n,s)$ is defined to be the minimum size of a subset $S\subseteq \mathcal{S}_n$ with the property that for any $\rho\in \mathcal{S}_n$ there exists some…

Combinatorics · Mathematics 2020-04-30 Kevin Hendrey , Ian M. Wanless

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…

Discrete Mathematics · Computer Science 2012-01-17 Pierrot Adeline , Rossin Dominique

We introduce and study minimal (with respect to inclusion) solutions of systems of tropical linear differential equations. We describe the set of all minimal solutions for a single equation. It is shown that any tropical linear differential…

Algebraic Geometry · Mathematics 2025-04-01 Dima Grigoriev , Cristhian Garay López

For any finite field ${\mathbb F}_q$ with $q$ elements, we study the set ${\mathcal F}_{(q,m)}$ of functions from ${\mathbb F}_q^m$ into ${\mathbb F}^q$. We introduce a transformation that allows us to determine a linear system of $q^{m+1}$…

Information Theory · Computer Science 2015-12-16 Miriam Abdon , Robert Rolland

In this paper, we establish the asymptotic expressions for the gradient of a solution to the Lam\'{e} systems with partially infinity coefficients as two rigid $C^{1,\gamma}$-inclusions are very close but not touching. The novelty of these…

Analysis of PDEs · Mathematics 2021-09-14 Xia Hao , Zhiwen Zhao

In this paper, we show that there is a large class of fermionic systems for which it is possible to find, for any dimension, a finite closed set of eigenoperators and eigenvalues of the Hamiltonian. Then, the hierarchy of the equations of…

Strongly Correlated Electrons · Physics 2007-07-27 Ferdinando Mancini

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…

Number Theory · Mathematics 2025-10-08 Firuz Rakhmonov

This paper deals with the solution of large classes of systems of nonlinear partial differential equations (PDEs) in spaces of generalized functions that are constructed as the completion of uniform convergence spaces. The existence result…

Analysis of PDEs · Mathematics 2009-02-18 Jan Harm van der Walt